An Algorithmic Framework for Motif Discovery Problems in Weighted Sequences

DOI10.1007/978-3-642-13073-1_30zbMath1284.68712OpenAlexW1574479362MaRDI QIDQ3563014

Costas S. Iliopoulos, Qing Guo, Hui Zhang

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)

Related Items

Polynomial-time approximation algorithms for weighted LCS problem, A multiobjective optimization algorithm for the weighted LCS, Compressed property suffix trees, Polynomial-Time Approximation Algorithms for Weighted LCS Problem