DIALIGN P: Fast pair-wise and multiple sequence alignment using parallel processors.
Martin SchmollingerKay NieseltMichael KaufmannBurkhard MorgensternPublished in: BMC Bioinform. (2004)
Keyphrases
- parallel processors
- multiple sequence alignment
- pairwise
- search problems
- sequence alignment
- protein sequences
- memory efficient
- genetic algorithm
- computational biology
- secondary structure
- biological sequences
- multiple alignment
- orders of magnitude
- search algorithm
- heuristic search
- belief propagation
- precedence constraints
- similarity measure
- beam search
- branch and bound algorithm
- multiple sequence alignments
- phylogenetic trees
- search strategies
- search strategy
- scheduling problem
- data structure