Indexing factors with gaps

DOI10.1007/s00453-007-9141-3zbMath1180.68127OpenAlexW1978255406MaRDI QIDQ2391183

M. Sohel Rahman, Costas S. Iliopoulos

Publication date: 24 July 2009

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-007-9141-3

zbMATH Keywords

algorithmssuffix treedata structuregapped-factorstring index

Mathematics Subject Classification ID

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

Related Items (11)

Document retrieval with one wildcard ⋮ Reporting consecutive substring occurrences under bounded gap constraints ⋮ Less space: indexing for queries with wildcards ⋮ String indexing for top-\(k\) close consecutive occurrences ⋮ Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints ⋮ Longest Common Prefix with Mismatches ⋮ Indexing a sequence for mapping reads with a single mismatch ⋮ Gapped indexing for consecutive occurrences ⋮ Substring Range Reporting ⋮ Substring range reporting ⋮ Orthogonal Range Searching for Text Indexing

Uses Software

• LAGAN
• MUSCLE
• PatternHunter

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Text indexing with errors
• On-line construction of suffix trees
• Longest repeats with a block of \(k\) don't cares
• Constructing suffix arrays in linear time
• Space efficient linear time construction of suffix arrays
• Suffix Arrays: A New Method for On-Line String Searches
• Dictionary matching and indexing with errors and don't cares
• Finding Patterns with Variable Length Gaps or Don’t Cares
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Jewels of Stringology
• Combinatorial Pattern Matching
• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS

This page was built for publication: Indexing factors with gaps