Longest Common Prefix with Mismatches

DOI10.1007/978-3-319-23826-5_29zbMath1446.68204OpenAlexW2397118291MaRDI QIDQ2949838

Giovanni Manzini

Publication date: 2 October 2015

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-23826-5_29

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (3)

Algorithmic Framework for Approximate Matching Under Bounded Edits with Applications to Sequence Analysis ⋮ Efficient computation of sequence mappability ⋮ Faster algorithms for 1-mappability of a sequence

Cites Work

• Unnamed Item
• Compact binary relation representations with rich functionality
• On the number of elements to reorder when updating a suffix array
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• Substring range reporting
• Computing the longest common prefix array based on the Burrows-Wheeler transform
• Indexing factors with gaps
• Compressed suffix trees with full functionality
• Weighted Ancestors in Suffix Trees
• Indexing a sequence for mapping reads with a single mismatch
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Suffix Arrays: A New Method for On-Line String Searches
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
• Sampled Longest Common Prefix Array
• Permuted Longest-Common-Prefix Array
• Algorithms on Strings, Trees and Sequences
• Text Indexing and Dictionary Matching with One Error
• Compressed suffix trees
• Inducing the LCP-Array
• Inducing Suffix and LCP Arrays in External Memory

This page was built for publication: Longest Common Prefix with Mismatches