Repository: Freie Universit├Ąt Berlin, Math Department

Multiple Sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics

Althaus, E. and Caprara, A. and Lenhof, H.-P. and Reinert, K. (2002) Multiple Sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics. In: Proceedings of the 1st European Conference on Computational Biology (ECCB 2002).

Full text not available from this repository.


Item Type:Conference or Workshop Item (UNSPECIFIED)
Subjects:Mathematical and Computer Sciences > Computer Science
Divisions:Department of Mathematics and Computer Science > Institute of Computer Science > Algorithmic Bioinformatics Group
ID Code:326
Deposited By: Admin Administrator
Deposited On:03 Mar 2017 14:40
Last Modified:03 Mar 2017 14:40

Repository Staff Only: item control page