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). Germany: Springer-Verlag. https://doi.org/10.1007/978-3-642-13509-5_8
Välimäki, Niko ; Ladra, Susana ; Mäkinen, Veli. / Approximate All-Pairs Suffix/Prefix Overlaps. CPM 2010: Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching . Vol. 21 Germany : Springer-Verlag, 2010. pp. 76-87 (Lecture Notes in Computer Science).
@inproceedings{a237d3dde4be4a83bb34471a8b6ee6fa,
title = "Approximate All-Pairs Suffix/Prefix Overlaps",
keywords = "113 Computer and information sciences",
author = "Niko V{\"a}lim{\"a}ki and Susana Ladra and Veli M{\"a}kinen",
note = "Volume: Proceeding volume: 21",
year = "2010",
doi = "10.1007/978-3-642-13509-5_8",
language = "English",
isbn = "0302-9743",
volume = "21",
series = "Lecture Notes in Computer Science",
publisher = "Springer-Verlag",
pages = "76--87",
booktitle = "CPM 2010",
address = "Germany",

}

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, Lecture Notes in Computer Science, vol. 6129, Springer-Verlag, Germany, pp. 76-87, Annual Symposium on Combinatorial Pattern Matching, New York, United States, 21/06/2010. https://doi.org/10.1007/978-3-642-13509-5_8

Approximate All-Pairs Suffix/Prefix Overlaps. / Välimäki, Niko; Ladra, Susana; Mäkinen, Veli.

CPM 2010: Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching . Vol. 21 Germany : Springer-Verlag, 2010. p. 76-87 (Lecture Notes in Computer Science; Vol. 6129).

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

TY - GEN

T1 - Approximate All-Pairs Suffix/Prefix Overlaps

AU - Välimäki, Niko

AU - Ladra, Susana

AU - Mäkinen, Veli

N1 - Volume: Proceeding volume: 21

PY - 2010

Y1 - 2010

KW - 113 Computer and information sciences

U2 - 10.1007/978-3-642-13509-5_8

DO - 10.1007/978-3-642-13509-5_8

M3 - Conference contribution

SN - 0302-9743

VL - 21

T3 - Lecture Notes in Computer Science

SP - 76

EP - 87

BT - CPM 2010

PB - Springer-Verlag

CY - Germany

ER -

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