[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 2089 || Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 2676 || Linear-Time Construction of Suffix Arrays

✍ Baeza-Yates, Ricardo; Chávez, Edgar; Crochemore, Maxime 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 380 KB

The refereed proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, CPM 2003, held in Morelia, Michoacán, Mexico in June 2003. The 28 revised full papers presented were carefully reviewed and selected from 57 submissions. The papers are devoted to current theoretical and computa

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 2676 || Linear-Time Construction of Suffix Arrays

✍ Baeza-Yates, Ricardo; Chávez, Edgar; Crochemore, Maxime 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 380 KB

The refereed proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, CPM 2003, held in Morelia, Michoacán, Mexico in June 2003. The 28 revised full papers presented were carefully reviewed and selected from 57 submissions. The papers are devoted to current theoretical and computa

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Science – Theory and Applications Volume 5010 || Computing Longest Common Substrings Via Suffix Arrays

✍ Hirsch, Edward A.; Razborov, Alexander A.; Semenov, Alexei; Slissenko, Anatol 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 423 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 5577 || Linear Time Suffix Array Construction Using D-Critical Substrings

✍ Kucherov, Gregory; Ukkonen, Esko 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 250 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 7922 || On Minimal and Maximal Suffixes of a Substring

✍ Fischer, Johannes; Sanders, Peter 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 184 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 7922 || Linear Time Lempel-Ziv Factorization: Simple, Fast, Small

✍ Fischer, Johannes; Sanders, Peter 📂 Article 📅 2013 🏛 Springer Berlin Heidelberg ⚖ 208 KB