✦ LIBER ✦

A more efficient algorithm for perfect sorting by reversals

✍ Scribed by Sèverine Bérard; Cedric Chauve; Christophe Paul

Book ID: 108154537
Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 191 KB
Volume: 106
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2007.10.012

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Faster and Simpler Algorithm for Sorti

A Faster and Simpler Algorithm for Sorting Signed Permutations by Reversals

✍ Kaplan, Haim; Shamir, Ron; Tarjan, Robert E. 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 321 KB

Sorting Strings by Reversals and by Tran

Sorting Strings by Reversals and by Transpositions

✍ Christie, David A.; Irving, Robert W. 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 169 KB

A more efficient algorithm for lattice b

A more efficient algorithm for lattice basis reduction

✍ C.P Schnorr 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 763 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

A ()-approximation algorithm for sorting

A ()-approximation algorithm for sorting by short block-moves

✍ Haitao Jiang; Daming Zhu; Binhai Zhu 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 598 KB

A more efficient branch and bound algori

A more efficient branch and bound algorithm for feature selection

✍ Bin Yu; Baozong Yuan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 429 KB