✦ LIBER ✦

More Efficient Algorithms for Closest String and Substring Problems

✍ Scribed by Ma, Bin; Sun, Xiaoming

Book ID: 118181072
Publisher: Society for Industrial and Applied Mathematics
Year: 2010
Tongue: English
Weight: 215 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/080739069

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fixed-Parameter Algorithms for CLOSEST S

Fixed-Parameter Algorithms for CLOSEST STRING and Related Problems

✍ Jens Gramm, Rolf Niedermeier and Peter Rossmanith 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 142 KB

Improved LP-based algorithms for the clo

Improved LP-based algorithms for the closest string problem

✍ F. Della Croce; F. Salassa 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 122 KB

Efficient algorithms for the longest com

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

✍ Tseng, Chiou-Ting; Yang, Chang-Biau; Ann, Hsing-Yen 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 228 KB

Improved optimization modelling for the

Improved optimization modelling for the closest string and related problems

✍ Peter Zörnig 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 289 KB

Efficient algorithms for consensus strin

Efficient algorithms for consensus string problems minimizing both distance sum and radius

✍ Amihood Amir; Gad M. Landau; Joong Chae Na; Heejin Park; Kunsoo Park; Jeong Seop 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 239 KB

A more efficient algorithm for MPR probl

A more efficient algorithm for MPR problems in phylogeny

✍ Hiroshi Narushima; Masazumi Hanazawa 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 497 KB

A discrete optimization problem of assigning linearly ordered character-states to the hypothetical ancestors of an evolutionary tree under the principle of maximum parsimony has been discussed. Under the transformation relation of linearly ordered character-states, Farris (1970) and have dealt with