Approximate all-pairs suffix/prefix overlaps

DOI10.1016/j.ic.2012.02.002zbMath1254.68361OpenAlexW2062266313MaRDI QIDQ418172

Susana Ladra, Niko Välimäki, Veli Mäkinen

Publication date: 24 May 2012

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2012.02.002

zbMATH Keywords

approximate pattern matchingsuffix/prefix matching

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (2)

Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis ⋮ Hierarchical overlap graph

Uses Software

• Soap
• Velvet
• BWA

Cites Work

• Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
• Bit-parallel witnesses and their applications to approximate string matching
• Combinatorial algorithms for DNA sequence assembly
• Compressed representations of sequences and full-text indexes
• Suffix Arrays: A New Method for On-Line String Searches
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Indexing compressed text
• Unified View of Backward Backtracking in Short Read Mapping
• Approximate All-Pairs Suffix/Prefix Overlaps
• Dictionary matching and indexing with errors and don't cares
• The theory and computation of evolutionary distances: Pattern recognition
• Algorithms on Strings, Trees and Sequences
• An Eulerian path approach to DNA fragment assembly
• Faster Filters for Approximate String Matching
• Dynamic Entropy-Compressed Sequences and Full-Text Indexes
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximate all-pairs suffix/prefix overlaps