Searching and Indexing Circular Patterns

DOI10.1007/978-3-319-59826-0_3zbMath1461.68268OpenAlexW2416996828MaRDI QIDQ3305518

Costas S. Iliopoulos, M. Sohel Rahman, Solon P. Pissis

Publication date: 7 August 2020

Published in: Algorithms for Next-Generation Sequencing Data (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-59826-0_3

Mathematics Subject Classification ID

Searching and sorting (68P10) Protein sequences, DNA sequences (92D20) Data structures (68P05) Algorithms on strings (68W32)

Related Items (2)

Circular pattern matching with \(k\) mismatches ⋮ Quasi-Linear-Time Algorithm for Longest Common Circular Factor

Cites Work

• Unnamed Item
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• The longest common extension problem revisited and applications to approximate string searching
• Approximate string matching using compressed suffix arrays
• Construction of Aho Corasick automaton in linear time for integer alphabets
• Average-optimal string matching
• On-line construction of suffix trees
• Faster compressed dictionary matching
• Average-Case Optimal Approximate Circular String Matching
• Algorithms on Strings
• Compressed indexes for dynamic text collections
• Accurate and Efficient Methods to Improve Multiple Circular Sequence Alignment
• Fast circular dictionary-matching algorithm
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Succinct Indexes for Circular Patterns
• Suffix Arrays: A New Method for On-Line String Searches
• Succinct Dictionary Matching with No Slowdown
• Efficient string matching
• Partial-Match Retrieval Algorithms
• Algorithms on Strings, Trees and Sequences
• Space-Efficient Construction Algorithm for the Circular Suffix Tree
• Inducing the LCP-Array
• Circular Sequence Comparison with q-grams
• Indexing Circular Patterns

This page was built for publication: Searching and Indexing Circular Patterns