Suffix tree characterization of maximal motifs in biological sequences
From MaRDI portal
Publication:732032
DOI10.1016/J.TCS.2009.07.020zbMATH Open1194.68104OpenAlexW1987638846MaRDI QIDQ732032FDOQ732032
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
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
- Algorithms on Strings, Trees and Sequences
- A Space-Economical Suffix Tree Construction Algorithm
- On-line construction of suffix trees
- RISOTTO: Fast Extraction of Motifs with Mismatches
- Title not available (Why is that?)
- Title not available (Why is that?)
- Structural Analysis of Gapped Motifs of a String
- String Processing and Information Retrieval
Cited In (7)
- Algorithms for extracting motifs from biological weighted sequences
- Longest property-preserved common factor: a new string-processing framework
- Irredundant tandem motifs
- Motif trie: an efficient text index for pattern discovery with don't cares
- Maximal motif discovery in a sliding window
- Algorithms and Computation
- Pattern masking for dictionary matching: theory and practice
Uses Software
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)
