@Proceedings{navarro_et_al:LIPIcs.CPM.2018,
title = {{LIPIcs, Volume 105, CPM'18, Complete Volume}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018},
URN = {urn:nbn:de:0030-drops-89341},
doi = {10.4230/LIPIcs.CPM.2018},
annote = {Keywords: Mathematics of computing, Discrete mathematics, Information theory,Information systems, Information retrieval, Theory of computation}
}
@InProceedings{navarro_et_al:LIPIcs.CPM.2018.0,
author = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.0},
URN = {urn:nbn:de:0030-drops-86849},
doi = {10.4230/LIPIcs.CPM.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{sakai:LIPIcs.CPM.2018.1,
author = {Sakai, Yoshifumi},
title = {{Maximal Common Subsequence Algorithms}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {1:1--1:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.1},
URN = {urn:nbn:de:0030-drops-87079},
doi = {10.4230/LIPIcs.CPM.2018.1},
annote = {Keywords: algorithms, string comparison, longest common subsequence, constrained longest common subsequence}
}
@InProceedings{henriques_et_al:LIPIcs.CPM.2018.2,
author = {Henriques, Rui and Francisco, Alexandre P. and Russo, Lu{\'\i}s M. S. and Bannai, Hideo},
title = {{Order-Preserving Pattern Matching Indeterminate Strings}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {2:1--2:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.2},
URN = {urn:nbn:de:0030-drops-87087},
doi = {10.4230/LIPIcs.CPM.2018.2},
annote = {Keywords: Order-preserving pattern matching, Indeterminate string analysis, Generic pattern matching, Satisfiability}
}
@InProceedings{baier:LIPIcs.CPM.2018.3,
author = {Baier, Uwe},
title = {{On Undetected Redundancy in the Burrows-Wheeler Transform}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.3},
URN = {urn:nbn:de:0030-drops-87049},
doi = {10.4230/LIPIcs.CPM.2018.3},
annote = {Keywords: Lossless data compression, BWT, Tunneling}
}
@InProceedings{amir_et_al:LIPIcs.CPM.2018.4,
author = {Amir, Amihood and Levy, Avivit and Porat, Ely},
title = {{Quasi-Periodicity Under Mismatch Errors}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.4},
URN = {urn:nbn:de:0030-drops-87054},
doi = {10.4230/LIPIcs.CPM.2018.4},
annote = {Keywords: Periodicity, Quasi-Periodicity, Cover, Approximate Cover}
}
@InProceedings{brubach:LIPIcs.CPM.2018.5,
author = {Brubach, Brian},
title = {{Fast Matching-based Approximations for Maximum Duo-Preservation String Mapping and its Weighted Variant}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.5},
URN = {urn:nbn:de:0030-drops-87066},
doi = {10.4230/LIPIcs.CPM.2018.5},
annote = {Keywords: approximation algorithm, maximum duo-preservation string mapping, minimum common string partition, string comparison, streaming algorithm, comparative genomics}
}
@InProceedings{blin_et_al:LIPIcs.CPM.2018.6,
author = {Blin, Guillaume and Blondin Mass\'{e}, Alexandre and Gasparoux, Marie and Hamel, Sylvie and Vandomme, \'{E}lise},
title = {{Nearest constrained circular words}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.6},
URN = {urn:nbn:de:0030-drops-87035},
doi = {10.4230/LIPIcs.CPM.2018.6},
annote = {Keywords: Circular constrained alignments, Manhattan distance, Application to brachytherapy}
}
@InProceedings{bannai_et_al:LIPIcs.CPM.2018.7,
author = {Bannai, Hideo and Gagie, Travis and I, Tomohiro},
title = {{Online LZ77 Parsing and Matching Statistics with RLBWTs}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {7:1--7:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.7},
URN = {urn:nbn:de:0030-drops-87025},
doi = {10.4230/LIPIcs.CPM.2018.7},
annote = {Keywords: Lempel-Ziv 1977, Matching Statistics, Run-Length Compressed Burrows-Wheeler Transform}
}
@InProceedings{hooshmand_et_al:LIPIcs.CPM.2018.8,
author = {Hooshmand, Sahar and Abedin, Paniz and K\"{u}lekci, M. Oguzhan and Thankachan, Sharma V.},
title = {{Non-Overlapping Indexing - Cache Obliviously}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {8:1--8:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.8},
URN = {urn:nbn:de:0030-drops-87009},
doi = {10.4230/LIPIcs.CPM.2018.8},
annote = {Keywords: Suffix Trees, Cache Oblivious, Data Structure, String Algorithms}
}
@InProceedings{aoyama_et_al:LIPIcs.CPM.2018.9,
author = {Aoyama, Kotaro and Nakashima, Yuto and I, Tomohiro and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{Faster Online Elastic Degenerate String Matching}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {9:1--9:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.9},
URN = {urn:nbn:de:0030-drops-87016},
doi = {10.4230/LIPIcs.CPM.2018.9},
annote = {Keywords: elastic degenerate pattern matching, boolean convolution}
}
@InProceedings{akutsu_et_al:LIPIcs.CPM.2018.10,
author = {Akutsu, Tatsuya and de la Higuera, Colin and Tamura, Takeyuki},
title = {{A Simple Linear-Time Algorithm for Computing the Centroid and Canonical Form of a Plane Graph and Its Applications}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {10:1--10:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.10},
URN = {urn:nbn:de:0030-drops-86992},
doi = {10.4230/LIPIcs.CPM.2018.10},
annote = {Keywords: Plane graph, Graph isomorphism, Maximum common subgraph}
}
@InProceedings{amir_et_al:LIPIcs.CPM.2018.11,
author = {Amir, Amihood and Boneh, Itai},
title = {{Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {11:1--11:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.11},
URN = {urn:nbn:de:0030-drops-86983},
doi = {10.4230/LIPIcs.CPM.2018.11},
annote = {Keywords: Dynamic Algorithms, Periodicity, Longest Common Factor, Priority Queue Data Structures, Suffix
Tree, Balanced Search Tree, Range Maximum Queries}
}
@InProceedings{funakoshi_et_al:LIPIcs.CPM.2018.12,
author = {Funakoshi, Mitsuru and Nakashima, Yuto and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{Longest substring palindrome after edit}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.12},
URN = {urn:nbn:de:0030-drops-86977},
doi = {10.4230/LIPIcs.CPM.2018.12},
annote = {Keywords: maximal palindromes, edit operations, periodicity, suffix trees}
}
@InProceedings{brubach_et_al:LIPIcs.CPM.2018.13,
author = {Brubach, Brian and Ghurye, Jay},
title = {{A Succinct Four Russians Speedup for Edit Distance Computation and One-against-many Banded Alignment}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {13:1--13:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.13},
URN = {urn:nbn:de:0030-drops-86965},
doi = {10.4230/LIPIcs.CPM.2018.13},
annote = {Keywords: edit distance, banded alignment, one-against-many alignment, genomics, method of the Four Russians}
}
@InProceedings{zhang_et_al:LIPIcs.CPM.2018.14,
author = {Zhang, Shu and Zhu, Daming and Jiang, Haitao and Ma, Jingjing and Guo, Jiong and Feng, Haodi},
title = {{Can a permutation be sorted by best short swaps?}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {14:1--14:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.14},
URN = {urn:nbn:de:0030-drops-86957},
doi = {10.4230/LIPIcs.CPM.2018.14},
annote = {Keywords: Algorithm, Complexity, Short Swap, Permutation, Reversal}
}
@InProceedings{inoue_et_al:LIPIcs.CPM.2018.15,
author = {Inoue, Takafumi and Inenaga, Shunsuke and Hyyr\"{o}, Heikki and Bannai, Hideo and Takeda, Masayuki},
title = {{Computing longest common square subsequences}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.15},
URN = {urn:nbn:de:0030-drops-86946},
doi = {10.4230/LIPIcs.CPM.2018.15},
annote = {Keywords: squares, subsequences, matching rectangles, dynamic programming}
}
@InProceedings{dudek_et_al:LIPIcs.CPM.2018.16,
author = {Dudek, Bartlomiej and Gawrychowski, Pawel},
title = {{Slowing Down Top Trees for Better Worst-Case Compression}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {16:1--16:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.16},
URN = {urn:nbn:de:0030-drops-86920},
doi = {10.4230/LIPIcs.CPM.2018.16},
annote = {Keywords: top trees, compression, tree grammars}
}
@InProceedings{fertin_et_al:LIPIcs.CPM.2018.17,
author = {Fertin, Guillaume and Fradin, Julien and Komusiewicz, Christian},
title = {{On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.17},
URN = {urn:nbn:de:0030-drops-86939},
doi = {10.4230/LIPIcs.CPM.2018.17},
annote = {Keywords: Subgraph problem, computational complexity, algorithms, fixed-parameter tractability, kernelization}
}
@InProceedings{chikhi_et_al:LIPIcs.CPM.2018.18,
author = {Chikhi, Rayan and Sch\"{o}nhuth, Alexander},
title = {{Dualities in Tree Representations}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {18:1--18:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.18},
URN = {urn:nbn:de:0030-drops-86901},
doi = {10.4230/LIPIcs.CPM.2018.18},
annote = {Keywords: Data Structures, Succinct Tree Representation, Balanced Parenthesis Representation, Isomorphisms}
}
@InProceedings{urabe_et_al:LIPIcs.CPM.2018.19,
author = {Urabe, Yuki and Nakashima, Yuto and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{Longest Lyndon Substring After Edit}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {19:1--19:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.19},
URN = {urn:nbn:de:0030-drops-86913},
doi = {10.4230/LIPIcs.CPM.2018.19},
annote = {Keywords: Lyndon word, Lyndon factorization, Lyndon tree, Edit operation}
}
@InProceedings{abedin_et_al:LIPIcs.CPM.2018.20,
author = {Abedin, Paniz and Hooshmand, Sahar and Ganguly, Arnab and Thankachan, Sharma V.},
title = {{The Heaviest Induced Ancestors Problem Revisited}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {20:1--20:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.20},
URN = {urn:nbn:de:0030-drops-86898},
doi = {10.4230/LIPIcs.CPM.2018.20},
annote = {Keywords: Data Structure, String Algorithms, Orthogonal Range Queries}
}
@InProceedings{cazaux_et_al:LIPIcs.CPM.2018.21,
author = {Cazaux, Bastien and Rivals, Eric},
title = {{Superstrings with multiplicities}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {21:1--21:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.21},
URN = {urn:nbn:de:0030-drops-86881},
doi = {10.4230/LIPIcs.CPM.2018.21},
annote = {Keywords: greedy algorithm, approximation, overlap, cyclic cover, APX, subset system}
}
@InProceedings{shin_et_al:LIPIcs.CPM.2018.22,
author = {Shin, Kilho and Ishikawa, Taichi},
title = {{Linear-time algorithms for the subpath kernel}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {22:1--22:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.22},
URN = {urn:nbn:de:0030-drops-86877},
doi = {10.4230/LIPIcs.CPM.2018.22},
annote = {Keywords: tree, kernel, suffix tree}
}
@InProceedings{charalampopoulos_et_al:LIPIcs.CPM.2018.23,
author = {Charalampopoulos, Panagiotis and Crochemore, Maxime and Iliopoulos, Costas S. and Kociumaka, Tomasz and Pissis, Solon P. and Radoszewski, Jakub and Rytter, Wojciech and Walen, Tomasz},
title = {{Linear-Time Algorithm for Long LCF with k Mismatches}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {23:1--23:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.23},
URN = {urn:nbn:de:0030-drops-86869},
doi = {10.4230/LIPIcs.CPM.2018.23},
annote = {Keywords: longest common factor, longest common substring, Hamming distance, heavy-light decomposition, difference cover}
}
@InProceedings{furuya_et_al:LIPIcs.CPM.2018.24,
author = {Furuya, Isamu and Nakashima, Yuto and I, Tomohiro and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{Lyndon Factorization of Grammar Compressed Texts Revisited}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {24:1--24:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.24},
URN = {urn:nbn:de:0030-drops-86855},
doi = {10.4230/LIPIcs.CPM.2018.24},
annote = {Keywords: Lyndon word, Lyndon factorization, Straight line program}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing