148 search results - page 8 / 30 » Constructing Big Trees from Short Sequences |
108
Voted
JCT
2007
15 years 8 days ago
2007
Abstract. Simple families of increasing trees can be constructed from simply generated tree families, if one considers for every tree of size n all its increasing labellings, i.e.,...
112
Voted
BMCBI
2010
15 years 15 days ago
2010
Background: Assembling genomic sequences from a set of overlapping reads is one of the most fundamental problems in computational biology. Algorithms addressing the assembly probl...
110
click to vote
PR
2006
15 years 9 days ago
2006
The tree representation of evolutionary relationship oversimplifies the view of the process of evolution as it cannot take into account the events such as horizontal gene transfer...
92
Voted
BMCBI
2008
15 years 15 days ago
2008
Background: Visualising the evolutionary history of a set of sequences is a challenge for molecular phylogenetics. One approach is to use undirected graphs, such as median network...
86
Voted
BMCBI
2007
15 years 15 days ago
2007
Background: In general, the construction of trees is based on sequence alignments. This procedure, however, leads to loss of informationwhen parts of sequence alignments (for inst...