Suffix tree characterization of maximal motifs in biological sequences

DOI10.1016/J.TCS.2009.07.020MaRDI QIDQ732032zbMATH OpenOpenAlexFDO

Authors Maria Federico, Nadia Pisanti

Publication date 9 October 2009

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL http://eprints.adm.unipi.it/645/1/suffix.pdf

zbMATH Keywords

suffix treemaximal motifsmotif discovery

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Searching and sorting (68P10)

Recommendations

• Algorithms for extracting motifs from biological weighted sequences
• Maximal motif discovery in a sliding window
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• RISOTTO: Fast Extraction of Motifs with Mismatches
• String Processing and Information Retrieval

Cites work

• scientific article; zbMATH DE number 1875416 (Why is no real title available?)
• scientific article; zbMATH DE number 1445317 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• On-line construction of suffix trees
• RISOTTO: Fast Extraction of Motifs with Mismatches
• String Processing and Information Retrieval
• Structural Analysis of Gapped Motifs of a String

Cited in

(7)

• Irredundant tandem motifs
• Motif trie: an efficient text index for pattern discovery with don't cares
• Longest property-preserved common factor: a new string-processing framework
• Pattern masking for dictionary matching: theory and practice
• Maximal motif discovery in a sliding window
• Algorithms for extracting motifs from biological weighted sequences
• Algorithms and Computation

Describes a project that uses

Uses Software

• RISOTTO

This page was built for publication: Suffix tree characterization of maximal motifs in biological sequences

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