Sciweavers

148 search results - page 8 / 30
» Constructing Big Trees from Short Sequences
Sort
View
95
Voted
JCT
2007
150views more  JCT 2007»
14 years 10 months ago
On the degree distribution of the nodes in increasing trees
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.,...
Markus Kuba, Alois Panholzer
BMCBI
2010
189views more  BMCBI 2010»
14 years 11 months ago
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs
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...
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh,...
94
Voted
PR
2006
76views more  PR 2006»
14 years 10 months ago
A pattern recognition-based approach for phylogenetic network construction with constrained recombination
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...
M. A. H. Zahid, Ankush Mittal, Ramesh Chandra Josh...
BMCBI
2008
96views more  BMCBI 2008»
14 years 11 months ago
Novel methodology for construction and pruning of quasi-median networks
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...
Sarah C. Ayling, Terence A. Brown
BMCBI
2007
115views more  BMCBI 2007»
14 years 11 months ago
Comparing sequences without using alignments: application to HIV/SIV subtyping
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...
Gilles Didier, Laurent Debomy, Maude Pupin, Ming Z...