INDEXING GAPPED-FACTORS USING A TREE

DOI10.1142/S0129054108005541MaRDI QIDQ3532141zbMATH OpenOpenAlexFDO

Authors Pierre Peterlongo, Julien Allali, Marie-France Sagot

Publication date 3 November 2008

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054108005541

zbMATH Keywords

suffix treesubstringsstring index\(k\)-factor tree

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Indexing factors with gaps
• Indexing Factors with Gaps
• Dictionary matching with a bounded gap in pattern or in text
• Dictionary matching with uneven gaps
• Motif matching using gapped patterns

Cites work

• A FIRST APPROACH TO FINDING COMMON MOTIFS WITH GAPS
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• Multiple filtration and approximate pattern matching
• On-line construction of suffix trees
• Truncated suffix trees and their application to data compression.

Cited in

(2)

• Indexing factors with gaps
• Indexing Factors with Gaps

This page was built for publication: INDEXING GAPPED-FACTORS USING A TREE

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