An improved algorithm for the all-pairs suffix-prefix problem

DOI10.1016/J.JDA.2016.04.002MaRDI QIDQ2628805zbMATH OpenOpenAlexFDO

Authors William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza

Publication date 15 July 2016

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

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

zbMATH Keywords

LCP arraysuffix arraysuffix-prefix matching

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Recommendations

• A fast algorithm for the all-pairs suffix-prefix problem
• An efficient algorithm for the all pairs suffix-prefix problem
• scientific article; zbMATH DE number 826056
• Approximate all-pairs suffix/prefix overlaps
• Algorithm engineering for all-pairs suffix-prefix matching

Cites work

• scientific article; zbMATH DE number 1786458 (Why is no real title available?)
• Algorithms on Strings, Trees and Sequences
• An efficient algorithm for the all pairs suffix-prefix problem
• Bioinformatics algorithms. Sequence analysis, genome rearrangements, and phylogenetic reconstruction
• Compressed suffix trees with full functionality
• Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
• External memory generalized suffix and LCP arrays construction
• Replacing suffix trees with enhanced suffix arrays
• Run-Length Compressed Indexes Are Superior for Highly Repetitive Sequence Collections
• Suffix Arrays: A New Method for On-Line String Searches

Cited in

(13)

• Parallel computation for the all-pairs suffix-prefix problem
• Approximate all-pairs suffix/prefix overlaps
• A simple algorithm for computing the document array
• External memory BWT and LCP computation for sequence collections with applications
• scientific article; zbMATH DE number 826056 (Why is no real title available?)
• An efficient algorithm for the all pairs suffix-prefix problem
• Hierarchical overlap graph
• Space-efficient construction of compressed suffix trees
• A fast algorithm for the all-pairs suffix-prefix problem
• Algorithm engineering for all-pairs suffix-prefix matching
• All-pairs suffix/prefix in optimal time using Aho-Corasick space
• Approximate All-Pairs Suffix/Prefix Overlaps
• Inducing enhanced suffix arrays for string collections

Describes a project that uses

Uses Software

• Readjoiner
• GtEncseq

This page was built for publication: An improved algorithm for the all-pairs suffix-prefix problem

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