Author of the publication

Approximate All-Pairs Suffix/Prefix Overlaps.

, , and . CPM, volume 6129 of Lecture Notes in Computer Science, page 76-87. Springer, (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Exploration and retrieval of whole-metagenome sequencing samples., , , and . Bioinform., 30 (17): 2471-2479 (2014)Space-Efficient Algorithms for Document Retrieval., and . CPM, volume 4580 of Lecture Notes in Computer Science, page 205-215. Springer, (2007)Distributed String Mining for High-Throughput Sequencing Data., and . WABI, volume 7534 of Lecture Notes in Computer Science, page 441-452. Springer, (2012)Efficient Path Kernels for Reaction Function Prediction., , , and . BIOINFORMATICS, page 202-207. SciTePress, (2012)Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections., , , and . SPIRE, volume 5280 of Lecture Notes in Computer Science, page 164-175. Springer, (2008)Storage and Retrieval of Individual Genomes., , , and . RECOMB, volume 5541 of Lecture Notes in Computer Science, page 121-137. Springer, (2009)Scalable and Versatile k-mer Indexing for High-Throughput Sequencing Data., and . ISBRA, volume 7875 of Lecture Notes in Computer Science, page 237-248. Springer, (2013)Least Random Suffix/Prefix Matches in Output-Sensitive Time.. CPM, volume 7354 of Lecture Notes in Computer Science, page 269-279. Springer, (2012)Engineering a Compressed Suffix Tree Implementation., , , and . WEA, volume 4525 of Lecture Notes in Computer Science, page 217-228. Springer, (2007)Unified View of Backward Backtracking in Short Read Mapping., , , and . Algorithms and Applications, volume 6060 of Lecture Notes in Computer Science, page 182-195. Springer, (2010)