Discovering frequent structured patterns from string databases: An application to biological sequences
From MaRDI portal
Recommendations
- A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS
- Discovering regularities in biosequences: Challenges and applications
- scientific article; zbMATH DE number 5204918
- scientific article; zbMATH DE number 1754502
- A parallel algorithm for pattern discovery in biological sequences
- Pattern Discovery in Bioinformatics
- A proposition for sequence mining using pattern structures
- On counting the frequency distribution of string motifs in molecular sequences
Cited in
(12)- Large-scale frequent stem pattern mining in RNA families
- Efficient algorithms for identifying orthologous simple sequence repeats of disease genes
- Frequent pattern mining with non-overlapping inversions
- Mining approximate repeating patterns from sequence data with gap constraints
- String analysis by sliding positioning strategy
- Indexing and mining of the local patterns in sequence database
- Modified PrefixSpan method for motif discovery in sequence databases
- scientific article; zbMATH DE number 2113956 (Why is no real title available?)
- A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS
- Rough Sets and Current Trends in Computing
- Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming
- Mining approximate patterns with frequent locally optimal occurrences
This page was built for publication: Discovering frequent structured patterns from string databases: An application to biological sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4420635)
