Linear-Time Algorithm for Long LCF with k Mismatches

Panagiotis Charalampopoulos; Maxime Crochemore; Costas S. Iliopoulos; Tomasz Kociumaka; Solon P. Pissis; Jakub Radoszewski; Wojciech Rytter; Tomasz Walen

doi:10.4230/LIPIcs.CPM.2018.23

Linear-Time Algorithm for Long LCF with k Mismatches

Panagiotis Charalampopoulos, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

18 Citations (Scopus)

Original language	English
Title of host publication	Annual Symposium on Combinatorial Pattern Matching (CPM 2018)
Editors	Gonzalo Navarro, David Sankoff, Binhai Zhu
Place of Publication	Dagstuhl, Germany
Publisher	Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
Pages	23:1-23:16
Volume	105
ISBN (Print)	978-3-95977-074-3
DOIs	https://doi.org/10.4230/LIPIcs.CPM.2018.23
Publication status	Published - 2018

Publication series

Name	Leibniz International Proceedings in Informatics (LIPIcs)
Publisher	Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

Access to Document

10.4230/LIPIcs.CPM.2018.23

http://drops.dagstuhl.de/opus/volltexte/2018/8686

Cite this

Charalampopoulos, P., Crochemore, M., Iliopoulos, C. S., Kociumaka, T., Pissis, S. P., Radoszewski, J., Rytter, W., & Walen, T. (2018). Linear-Time Algorithm for Long LCF with k Mismatches. In G. Navarro, D. Sankoff, & B. Zhu (Eds.), Annual Symposium on Combinatorial Pattern Matching (CPM 2018) (Vol. 105, pp. 23:1-23:16). (Leibniz International Proceedings in Informatics (LIPIcs)). Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.CPM.2018.23

Charalampopoulos, Panagiotis ; Crochemore, Maxime ; Iliopoulos, Costas S. et al. / Linear-Time Algorithm for Long LCF with k Mismatches. Annual Symposium on Combinatorial Pattern Matching (CPM 2018). editor / Gonzalo Navarro ; David Sankoff ; Binhai Zhu. Vol. 105 Dagstuhl, Germany : Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. pp. 23:1-23:16 (Leibniz International Proceedings in Informatics (LIPIcs)).

@inproceedings{83ed323d24754567b12a95d690bd3063,

title = "Linear-Time Algorithm for Long LCF with k Mismatches",

author = "Panagiotis Charalampopoulos and Maxime Crochemore and Iliopoulos, {Costas S.} and Tomasz Kociumaka and Pissis, {Solon P.} and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen",

year = "2018",

doi = "10.4230/LIPIcs.CPM.2018.23",

language = "English",

isbn = "978-3-95977-074-3",

volume = "105",

series = "Leibniz International Proceedings in Informatics (LIPIcs)",

publisher = "Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",

pages = "23:1--23:16",

editor = "Gonzalo Navarro and David Sankoff and Binhai Zhu",

booktitle = "Annual Symposium on Combinatorial Pattern Matching (CPM 2018)",

}

Charalampopoulos, P , Crochemore, M , Iliopoulos, CS, Kociumaka, T, Pissis, SP, Radoszewski, J, Rytter, W & Walen, T 2018, Linear-Time Algorithm for Long LCF with k Mismatches. in G Navarro, D Sankoff & B Zhu (eds), Annual Symposium on Combinatorial Pattern Matching (CPM 2018). vol. 105, Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany, pp. 23:1-23:16. https://doi.org/10.4230/LIPIcs.CPM.2018.23

Linear-Time Algorithm for Long LCF with k Mismatches. / Charalampopoulos, Panagiotis ; Crochemore, Maxime ; Iliopoulos, Costas S. et al.
Annual Symposium on Combinatorial Pattern Matching (CPM 2018). ed. / Gonzalo Navarro; David Sankoff; Binhai Zhu. Vol. 105 Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2018. p. 23:1-23:16 (Leibniz International Proceedings in Informatics (LIPIcs)).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Linear-Time Algorithm for Long LCF with k Mismatches

AU - Charalampopoulos, Panagiotis

AU - Crochemore, Maxime

AU - Iliopoulos, Costas S.

AU - Kociumaka, Tomasz

AU - Pissis, Solon P.

AU - Radoszewski, Jakub

AU - Rytter, Wojciech

AU - Walen, Tomasz

PY - 2018

Y1 - 2018

U2 - 10.4230/LIPIcs.CPM.2018.23

DO - 10.4230/LIPIcs.CPM.2018.23

M3 - Conference contribution

SN - 978-3-95977-074-3

VL - 105

T3 - Leibniz International Proceedings in Informatics (LIPIcs)

SP - 23:1-23:16

BT - Annual Symposium on Combinatorial Pattern Matching (CPM 2018)

A2 - Navarro, Gonzalo

A2 - Sankoff, David

A2 - Zhu, Binhai

PB - Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik

CY - Dagstuhl, Germany

ER -

Charalampopoulos P , Crochemore M , Iliopoulos CS, Kociumaka T, Pissis SP, Radoszewski J et al. Linear-Time Algorithm for Long LCF with k Mismatches. In Navarro G, Sankoff D, Zhu B, editors, Annual Symposium on Combinatorial Pattern Matching (CPM 2018). Vol. 105. Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. 2018. p. 23:1-23:16. (Leibniz International Proceedings in Informatics (LIPIcs)). doi: 10.4230/LIPIcs.CPM.2018.23