Efficient Generation of Evolutionary Trees
Autor(a) principal: | |
---|---|
Data de Publicação: | 2007 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | INFOCOMP: Jornal de Ciência da Computação |
Texto Completo: | https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/161 |
Resumo: | 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. |
id |
UFLA-5_13302a27cff0d5e49a13958668441292 |
---|---|
oai_identifier_str |
oai:infocomp.dcc.ufla.br:article/161 |
network_acronym_str |
UFLA-5 |
network_name_str |
INFOCOMP: Jornal de Ciência da Computação |
repository_id_str |
|
spelling |
Efficient Generation of Evolutionary TreesBioinformaticsEvolutionary TreesGraphsAlgorithmGenerating ProblemsFor 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.Editora da UFLA2007-03-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionapplication/pdfhttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/161INFOCOMP Journal of Computer Science; Vol. 6 No. 1 (2007): March, 2007; 30-361982-33631807-4545reponame:INFOCOMP: Jornal de Ciência da Computaçãoinstname:Universidade Federal de Lavras (UFLA)instacron:UFLAenghttps://infocomp.dcc.ufla.br/index.php/infocomp/article/view/161/146Copyright (c) 2016 INFOCOMP Journal of Computer Scienceinfo:eu-repo/semantics/openAccessAdnan, Muhammad AbdullahRahman, MD.Saidur2015-06-27T23:29:25Zoai:infocomp.dcc.ufla.br:article/161Revistahttps://infocomp.dcc.ufla.br/index.php/infocompPUBhttps://infocomp.dcc.ufla.br/index.php/infocomp/oaiinfocomp@dcc.ufla.br||apfreire@dcc.ufla.br1982-33631807-4545opendoar:2024-05-21T19:54:21.232747INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA)true |
dc.title.none.fl_str_mv |
Efficient Generation of Evolutionary Trees |
title |
Efficient Generation of Evolutionary Trees |
spellingShingle |
Efficient Generation of Evolutionary Trees Adnan, Muhammad Abdullah Bioinformatics Evolutionary Trees Graphs Algorithm Generating Problems |
title_short |
Efficient Generation of Evolutionary Trees |
title_full |
Efficient Generation of Evolutionary Trees |
title_fullStr |
Efficient Generation of Evolutionary Trees |
title_full_unstemmed |
Efficient Generation of Evolutionary Trees |
title_sort |
Efficient Generation of Evolutionary Trees |
author |
Adnan, Muhammad Abdullah |
author_facet |
Adnan, Muhammad Abdullah Rahman, MD.Saidur |
author_role |
author |
author2 |
Rahman, MD.Saidur |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Adnan, Muhammad Abdullah Rahman, MD.Saidur |
dc.subject.por.fl_str_mv |
Bioinformatics Evolutionary Trees Graphs Algorithm Generating Problems |
topic |
Bioinformatics Evolutionary Trees Graphs Algorithm Generating Problems |
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. |
publishDate |
2007 |
dc.date.none.fl_str_mv |
2007-03-01 |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/161 |
url |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/161 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
https://infocomp.dcc.ufla.br/index.php/infocomp/article/view/161/146 |
dc.rights.driver.fl_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science info:eu-repo/semantics/openAccess |
rights_invalid_str_mv |
Copyright (c) 2016 INFOCOMP Journal of Computer Science |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Editora da UFLA |
publisher.none.fl_str_mv |
Editora da UFLA |
dc.source.none.fl_str_mv |
INFOCOMP Journal of Computer Science; Vol. 6 No. 1 (2007): March, 2007; 30-36 1982-3363 1807-4545 reponame:INFOCOMP: Jornal de Ciência da Computação instname:Universidade Federal de Lavras (UFLA) instacron:UFLA |
instname_str |
Universidade Federal de Lavras (UFLA) |
instacron_str |
UFLA |
institution |
UFLA |
reponame_str |
INFOCOMP: Jornal de Ciência da Computação |
collection |
INFOCOMP: Jornal de Ciência da Computação |
repository.name.fl_str_mv |
INFOCOMP: Jornal de Ciência da Computação - Universidade Federal de Lavras (UFLA) |
repository.mail.fl_str_mv |
infocomp@dcc.ufla.br||apfreire@dcc.ufla.br |
_version_ |
1799874740415889408 |