An algorithmic framework for motif discovery problems in weighted sequences

DOI10.1007/978-3-642-13073-1_30MaRDI QIDQ3563014zbMATH OpenOpenAlexFDO

Authors Hui Zhang, Qing Guo, Costas S. Iliopoulos

Publication date 28 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13073-1_30

Mathematics Subject Classification ID

Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Recommendations

• String Processing and Information Retrieval
• Algorithms for extracting motifs from biological weighted sequences
• Varieties of Regularities in Weighted Sequences
• Computational and Information Science
• Experimental results in pattern matching on weighted sequences

Cited in

(9)

• An approximation algorithm for alignment of multiple sequences using motif discovery
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• String Processing and Information Retrieval
• Compressed property suffix trees
• A multiobjective optimization algorithm for the weighted LCS
• Algorithms for extracting motifs from biological weighted sequences
• Parallel Discovery of Top-k Weighted Motifs in Large Graphs
• Polynomial-time approximation algorithms for weighted LCS problem
• Polynomial-time approximation algorithms for weighted LCS problem

This page was built for publication: An algorithmic framework for motif discovery problems in weighted sequences

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