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

[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] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 5577 || Generalized Substring Compression

✍ Kucherov, Gregory; Ukkonen, Esko 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 229 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 2089 || Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications

✍ Landau, Gad M.; Amir, Amihood 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 245 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Pattern Matching Volume 1848 || Linear Bidirectional On-Line Construction of Affix Trees

✍ Giancarlo, Raffaele; Sankoff, David 📂 Article 📅 2000 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 310 KB

This Book Constitutes The Refereed Proceedings Of The 11th Annual Symposium On Combinatorial Pattern Matching, Cpm 2000, Held In Montreal, Canada, In June 2000.the 29 Revised Full Papers Presented Together With 3 Invited Contributions And 2 Tutorial Lectures Were Carefully Reviewed And Selected From