INDEXING GAPPED-FACTORS USING A TREE

DOI10.1142/S0129054108005541zbMath1169.68378OpenAlexW2059427795MaRDI QIDQ3532141

Julien Allali, Pierre Peterlongo, 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

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

Cites Work

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