Loading...
Please wait, while we are loading the content...
Similar Documents
Genetic Algorithms And The Multiple Sequence Alignment Problem In Biology (1996)
| Content Provider | CiteSeerX |
|---|---|
| Author | Karadimitriou, Kosmas Kraft, Donald H. |
| Description | Multiple Sequence Alignment is an important problem in molecular biology, where it is used for constructing evolutionary trees from DNA sequences and for analyzing the protein structures to help design new proteins. To date, most multiple alignment methods are based on a dynamic programming approach. This approach however results in exponential time complexity, since it requires time proportional to the product of the sequence lengths. Tree-based algorithms, which combine results from pairwise alignments, have also been proposed. However, these algorithms depend on the existence of a tree that describes the relations between the sequences, and this tree cannot always be obtained. In general, Multiple Sequence Alignment belongs to a class of hard optimization problems called combinatorial problems. One of the methods that has been developed recently to solve this type of problems is Genetic Algorithms. Genetic Algorithms create a "population" of random solutions and then use the concept... |
| File Format | |
| Language | English |
| Publisher Date | 1996-01-01 |
| Publisher Institution | Proceedings of the Second Annual Molecular Biology and Biotechnology Conference |
| Access Restriction | Open |
| Subject Keyword | Tree-based Algorithm Exponential Time Complexity Molecular Biology Dynamic Programming Approach Genetic Algorithm Hard Optimization Problem New Protein Dna Sequence Multiple Sequence Alignment Problem Important Problem Random Solution Multiple Sequence Alignment Evolutionary Tree Tree Cannot Pairwise Alignment Multiple Alignment Method Combinatorial Problem Sequence Length |
| Content Type | Text |
| Resource Type | Article |
