Multiple sequence alignment with arbitrary gap costs: Computing an optimal solution using polyhedral combinatorics.
Ernst AlthausAlberto CapraraHans-Peter LenhofKnut ReinertPublished in: ECCB (2002)
Keyphrases
- multiple sequence alignment
- optimal solution
- total cost
- memory efficient
- computational biology
- protein sequences
- secondary structure
- genetic algorithm
- multiple alignment
- biological sequences
- graph theory
- sequence alignment
- objective function
- np hard
- knapsack problem
- phylogenetic trees
- databases
- branch and bound
- data model
- search space
- lower bound
- reinforcement learning
- neural network