Approximate All-Pairs Suffix/Prefix Overlaps

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

Original languageEnglish
Title of host publicationCPM 2010 : Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching
Volume21
Place of PublicationGermany
PublisherSpringer-Verlag
Publication date2010
Pages76-87
ISBN (Print)0302-9743
ISBN (Electronic)978-3-642-13508-8
DOIs
Publication statusPublished - 2010
MoE publication typeA4 Article in conference proceedings
EventAnnual Symposium on Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010 - New York, NY, New York, United States
Duration: 21 Jun 201023 Jun 2010
Conference number: 21

Publication series

NameLecture Notes in Computer Science
Volume6129
ISSN (Print)0302-9743

Fields of Science

  • 113 Computer and information sciences

Cite this

Välimäki, N., Ladra, S., & Mäkinen, V. (2010). Approximate All-Pairs Suffix/Prefix Overlaps. In CPM 2010: Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching (Vol. 21, pp. 76-87). (Lecture Notes in Computer Science; Vol. 6129). Springer-Verlag. https://doi.org/10.1007/978-3-642-13509-5_8