✦ LIBER ✦

A branch-and-cut algorithm for multiple sequence alignment

✍ Scribed by Ernst Althaus; Alberto Caprara; Hans-Peter Lenhof; Knut Reinert

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 519 KB
Volume: 105
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0659-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A genetic algorithm for multiple sequenc

A genetic algorithm for multiple sequence alignment

✍ Jorng-Tzong Horng; Li-Cheng Wu; Ching-Mei Lin; Bing-He Yang 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 571 KB

Approximation algorithms for multiple se

Approximation algorithms for multiple sequence alignment

✍ Vineet Bafna; Eugene L. Lawler; Pavel A. Pevzner 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 793 KB

We consider the problem of aligning of k sequences of length n. The cost function is sum of pairs, and satisfies triangle inequality. Earlier results on finding approximation algorithms for this problem are due to Gusfield (1991) who achieved an approximation ratio of 2 -2/k, and Pevzner (1992) who

A branch-and-cut algorithm for partition

A branch-and-cut algorithm for partition coloring

✍ Yuri Frota; Nelson Maculan; Thiago F. Noronha; Celso C. Ribeiro 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB 👁 1 views

Multiple sequence alignment algorithm ba

Multiple sequence alignment algorithm based on a dispersion graph and ant colony algorithm

✍ Weiyang Chen; Bo Liao; Wen Zhu; Xuyu Xiang 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 213 KB

## Abstract In this article, we describe a representation for the processes of multiple sequences alignment (MSA) and used it to solve the problem of MSA. By this representation, we took every possible aligning result into account by defining the representation of gap insertion, the value of heuris

A branch-and-cut algorithm for the preem

A branch-and-cut algorithm for the preemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; G. Laporte 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 247 KB 👁 1 views

## Abstract In the swapping problem (SP), every vertex of a complete graph may supply and demand an object of a known type. A vehicle of unit capacity starting and ending its tour at an arbitrary vertex is available for carrying objects of given types between vertices. The SP consists of determinin

A branch-and-cut algorithm for the nonpr

A branch-and-cut algorithm for the nonpreemptive swapping problem

✍ Charles Bordenave; Michel Gendreau; Gilbert Laporte 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB 👁 1 views