Sciweavers

1731 search results - page 148 / 347
» Maximum likelihood analysis of algorithms and data structure...
Sort
View
ICCS
2009
Springer
14 years 2 months ago
GPU Accelerated RNA Folding Algorithm
Many bioinformatics studies require the analysis of RNA or DNA structures. More specifically, extensive work is done to elaborate efficient algorithms able to predict the 2-D fold...
Guillaume Rizk, Dominique Lavenier
BIB
2010
68views more  BIB 2010»
13 years 8 months ago
Genome variation discovery with high-throughput sequencing data
The advent of high-throughput sequencing (HTS) technologies is enabling sequencing of human genomes at a significantly lower cost. The availability of these genomes is hoped to en...
Adrian V. Dalca, Michael Brudno
SIBGRAPI
2006
IEEE
14 years 2 months ago
Determining the branchings of 3D structures from respective 2D projections
This work describes a new framework for automatic extraction of 2D branching structures images obtained from 3D shapes, such as neurons and retinopathy images. The majority of met...
Jorge J. G. Leandro, Roberto M. Cesar, Luciano da ...
CIBCB
2008
IEEE
14 years 2 months ago
Very large scale ReliefF for genome-wide association analysis
— The genetic causes of many monogenic diseases have already been discovered. However, most common diseases are actually the result of complex nonlinear interactions between mult...
Margaret J. Eppstein, Paul Haake
ISAAC
2007
Springer
70views Algorithms» more  ISAAC 2007»
14 years 2 months ago
Kinetic Maintenance of Mobile k-Centres on Trees
Let C denote a set of n mobile clients, each of which follows a continuous trajectory on a weighted tree T. We establish tight bounds on the maximum relative velocity of the 1-cent...
Stephane Durocher, Christophe Paul