@inproceedings{526561a2eb7b4968a5b6f6b6b02b808c,

title = "Improved filters for the approximate suffix-prefix overlap problem",

abstract = "Computing suffix-prefix overlaps for a large collection of strings is a fundamental building block for the analysis of genomic nextgeneration sequencing data. The approximate suffix-prefix overlap problem is to find all pairs of strings from a given set such that a prefix of one string is similar to a suffix of the other. V{\"a}lim{\"a}ki et al. (Information and Computation, 2012) gave a solution to this problem based on suffix filters. In this work, we propose two improvements to the method of V{\"a}lim{\"a}ki et al. that reduce the running time of the computation.",

author = "Gregory Kucherov and Dekel Tsur",

year = "2014",

doi = "10.1007/978-3-319-11918-2",

language = "English",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "139--148",

editor = "Edleno Moura and Maxime Crochemore",

booktitle = "String Processing and Information Retrieval - 21st International Symposium, SPIRE 2014, Proceedings",

note = "21st International Symposium on String Processing and Information Retrieval, SPIRE 2014 ; Conference date: 20-10-2014 Through 22-10-2014",

}