𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Landau, Gad M.; Amir, Amihood


Book ID
119999152
Publisher
Springer Berlin Heidelberg
Year
2001
Weight
245 KB
Category
Article
ISBN
354048194X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Comb
✍ 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
✍ 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