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

DOI10.1142/S1793005705000111zbMATH Open1089.68623OpenAlexW2079002629WikidataQ113776689 ScholiaQ113776689MaRDI QIDQ5312640FDOQ5312640

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

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

zbMATH Keywords

sequence analysispattern discovery

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• Mining approximate repeating patterns from sequence data with gap constraints
• Title not available (Why is that?)

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)