Distributed suffix trees

DOI10.1016/J.JDA.2004.08.004MaRDI QIDQ2569396zbMATH OpenOpenAlexFDO

Authors Raphaël Clifford

Publication date 27 October 2005

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jda.2004.08.004

zbMATH Keywords

distributed computingbioinformaticsstring matchingsuffix trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Distributed and paged suffix trees for large genetic databases
• Constructing large suffix trees on a computational grid
• Parallel construction of a suffix tree with applications
• Lightweight distributed suffix array construction
• Engineering a compressed suffix tree implementation

Cites work

• scientific article; zbMATH DE number 432779 (Why is no real title available?)
• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• scientific article; zbMATH DE number 1263248 (Why is no real title available?)
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 871935 (Why is no real title available?)
• scientific article; zbMATH DE number 871936 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• An efficient algorithm for the all pairs suffix-prefix problem
• Fast lightweight suffix array construction and checking
• From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
• Improved behaviour of tries by adaptive branching
• On-line construction of suffix trees
• Optimal parallel suffix tree construction
• Sublinear approximate string matching and biological applications
• Suffix trees on words
• The string B-tree

Cited in

(5)

• Distributed and paged suffix trees for large genetic databases
• PSIST: a scalable approach to indexing protein structures using suffix trees
• Constructing generalized suffix trees on distributed parallel platforms
• Constructing large suffix trees on a computational grid
• String Processing and Information Retrieval

Describes a project that uses

Uses Software

• MUMMER
• REPuter

This page was built for publication: Distributed suffix trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2569396)