RI UFLA (Universidade Federal de Lavras) >
Revistas UFLA >
Please use this identifier to cite or link to this item:
|Title: ||Efficient Generation of Evolutionary Trees|
|???metadata.dc.creator???: ||Adnan, Muhammad Abdullah|
|Keywords: ||Bioinformatics, Evolutionary Trees, Graphs, Algorithm, Generating Problems|
|Publisher: ||Editora da UFLA|
|Other Identifiers: ||http://www.dcc.ufla.br/infocomp/index.php/INFOCOMP/article/view/161|
|Description: ||For the purposes of phylogenetic analysis, it is assumed that the phylogenetic pattern of evolutionary history can be represented as a branching diagram like a tree, with the terminal branches (or leaves) linking the species being analyzed and the internal branches linking hypothesized ancestral species. To a mathematician, such a tree is simply a cycle-free connected graph, but to a biologist it represents a series of hypotheses about evolutionary events. In this paper we are concerned with generating all such probable evolutionary trees that will guide biologists to research in all biological subdisciplines. We give an algorithm to generate all evolutionary trees having n ordered species without repetition. We also find out an efficient representation of such evolutionary trees such that each tree is generated in constant time on average.|
|Appears in Collections:||Infocomp|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.