Sciweavers

804 search results - page 3 / 161
» Solutions to Computational Problems Through Gene Assembly
Sort
View
WABI
2007
Springer
139views Bioinformatics» more  WABI 2007»
14 years 1 months ago
Computability of Models for Sequence Assembly
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
Paul Medvedev, Konstantinos Georgiou, Gene Myers, ...
CAD
2004
Springer
13 years 7 months ago
A single solution method for converting 2D assembly drawings to 3D part drawings
Although solid models play a central role in modern CAD systems, 2D CAD systems are still commonly used for designing products without complex curved faces. Therefore, an importan...
Masaji Tanaka, Laurence Anthony, Toshiaki Kaneeda,...
RECOMB
2008
Springer
14 years 8 months ago
Locating Multiple Gene Duplications through Reconciled Trees
We introduce the first exact and efficient algorithm for Guig?o et al.'s problem that, given a collection of rooted, binary gene trees and a rooted, binary species tree, deter...
J. Gordon Burleigh, Mukul S. Bansal, André ...
BMCBI
2007
151views more  BMCBI 2007»
13 years 7 months ago
Minimus: a fast, lightweight genome assembler
Background: Genome assemblers have grown very large and complex in response to the need for algorithms to handle the challenges of large whole-genome sequencing projects. Many of ...
Daniel D. Sommer, Arthur L. Delcher, Steven L. Sal...
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
14 years 1 months ago
Computation reuse for rigid-body dynamics
— The accelerations of and forces among contacting rigid bodies may be computed by formulating the dynamics equations and contact constraints as a complementarity problem [1]. Da...
Anne Loomis, Devin J. Balkcom