Searching and indexing circular patterns

DOI10.1007/978-3-319-59826-0_3MaRDI QIDQ3305518zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• Circular sequence comparison with q-grams
• Indexing Circular Patterns
• Succinct indexes for circular patterns
• Finding optimal alignment and consensus of circular strings
• A simple, fast, filter-based algorithm for circular sequence comparison

Cites work

• Accurate and efficient methods to improve multiple circular sequence alignment
• Algorithms on Strings, Trees and Sequences
• Algorithms on strings. Translated from the 2001 French original
• Approximate string matching using compressed suffix arrays
• Average-case optimal approximate circular string matching
• Average-optimal string matching
• Bidirectional search in a string with wavelet trees and bidirectional matching statistics
• Circular sequence comparison with q-grams
• Compressed indexes for dynamic text collections
• Construction of Aho Corasick automaton in linear time for integer alphabets
• Efficient string matching
• Fast circular dictionary-matching algorithm
• Faster compressed dictionary matching
• scientific article; zbMATH DE number 2183071 (Why is no real title available?)
• Indexing Circular Patterns
• Inducing the LCP-array
• On-line construction of suffix trees
• Partial-Match Retrieval Algorithms
• Space-efficient construction algorithm for the circular suffix tree
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• Succinct Dictionary Matching with No Slowdown
• Succinct indexes for circular patterns
• Suffix Arrays: A New Method for On-Line String Searches
• The longest common extension problem revisited and applications to approximate string searching

Cited in

(8)

• Quasi-Linear-Time Algorithm for Longest Common Circular Factor
• Circular sequence comparison with q-grams
• Indexing Circular Patterns
• Circular pattern matching with \(k\) mismatches
• Sorting circular suffixes in linear time
• Internal pattern matching in small space and applications
• Approximate circular pattern matching
• Quasi-linear-time algorithm for a longest common circular factor

This page was built for publication: Searching and indexing circular patterns

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