Parallel construction of a suffix tree: Extended abstract

Gad M. Landau, Baruch Schieber, Uzi Vishkin

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

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 languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 14th International Colloquium, Proceedings
EditorsThomas Ottmann
PublisherSpringer Verlag
Pages314-325
Number of pages12
ISBN (Print)9783540180883
DOIs
StatePublished - 1987
Externally publishedYes
Event14th International Colloquium on Automata, Languages, and Programming, ALP 1987 - Karlsruhe, Germany
Duration: Jul 13 1987Jul 17 1987

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume267 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Colloquium on Automata, Languages, and Programming, ALP 1987
CountryGermany
CityKarlsruhe
Period7/13/877/17/87

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Parallel construction of a suffix tree: Extended abstract'. Together they form a unique fingerprint.

Cite this