Sciweavers

148 search results - page 3 / 30
» Constructing Big Trees from Short Sequences
Sort
View
96
Voted
BICOB
2009
Springer
15 years 5 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
WABI
2009
Springer
117views Bioinformatics» more  WABI 2009»
15 years 5 months ago
A Simulation Study Comparing Supertree and Combined Analysis Methods Using SMIDGen
Background: Supertree methods comprise one approach to reconstructing large molecular phylogenies given multi-marker datasets: trees are estimated on each marker and then combined...
M. Shel Swenson, François Barbançon,...
ECCB
2008
IEEE
15 years 5 months ago
Connect the dots: exposing hidden protein family connections from the entire sequence tree
Motivation: Mapping of remote evolutionary links is a classic computational problem of much interest. Relating protein families allows for functional and structural inference on u...
Yaniv Loewenstein, Michal Linial
ICC
2007
IEEE
15 years 5 months ago
A Fast Broadcast Tree Construction in Multi-Rate Wireless Mesh Networks
— One of the wireless mesh network’s important features is each node can support more than one transmission rate. However, few previous literatures on the broadcast tree constr...
Tai Wang, Xu Du, Wenqing Cheng, Zongkai Yang, Wei ...
ICML
2003
IEEE
15 years 11 months ago
Decision-tree Induction from Time-series Data Based on a Standard-example Split Test
This paper proposes a novel decision tree for a data set with time-series attributes. Our time-series tree has a value (i.e. a time sequence) of a time-series attribute in its int...
Yuu Yamada, Einoshin Suzuki, Hideto Yokoi, Katsuhi...