Abstract
Weiner's [We-73] suffix tree is known to be a powerful tool for string manipulations. We present a parallel algorithm for constructing a suffix tree. The algorithm runs in O(log n) time and uses n processors. We also present applications for designing efficient parallel algorithms for several string problems.
| Original language | English |
|---|---|
| Title of host publication | Automata, Languages and Programming - 14th International Colloquium, Proceedings |
| Editors | Thomas Ottmann |
| Publisher | Springer Verlag |
| Pages | 314-325 |
| Number of pages | 12 |
| ISBN (Print) | 9783540180883 |
| DOIs | |
| State | Published - 1987 |
| Externally published | Yes |
| Event | 14th International Colloquium on Automata, Languages, and Programming, ALP 1987 - Karlsruhe, Germany Duration: 13 Jul 1987 → 17 Jul 1987 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 267 LNCS |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | 14th International Colloquium on Automata, Languages, and Programming, ALP 1987 |
|---|---|
| Country/Territory | Germany |
| City | Karlsruhe |
| Period | 13/07/87 → 17/07/87 |
Bibliographical note
Publisher Copyright:© 1987, Springer-Verlag.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science