A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS

DOI10.1142/S1793005705000111MaRDI QIDQ5312640zbMATH OpenOpenAlexWikidataFDO

Authors G. Terracina

Publication date 1 September 2005

Published in New Mathematics and Natural Computation (Search for Journal in Brave)

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

zbMATH Keywords

pattern discoverysequence analysis

Mathematics Subject Classification ID

Searching and sorting (68P10) Pattern recognition, speech recognition (68T10) Protein sequences, DNA sequences (92D20)

Recommendations

• scientific article; zbMATH DE number 1966522
• A parallel algorithm for pattern discovery in biological sequences
• scientific article; zbMATH DE number 2113956
• Frequent pattern mining with non-overlapping inversions
• scientific article; zbMATH DE number 1983142

Cites work

• Algorithms on Strings, Trees and Sequences
• Dynamic dictionary matching
• The string B-tree

Cited in

(4)

• Frequent pattern mining with non-overlapping inversions
• Mining approximate repeating patterns from sequence data with gap constraints
• scientific article; zbMATH DE number 5168318 (Why is no real title available?)
• scientific article; zbMATH DE number 1966522 (Why is no real title available?)

This page was built for publication: A FAST TECHNIQUE FOR DERIVING FREQUENT STRUCTURED PATTERNS FROM BIOLOGICAL DATA SETS

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