Sciweavers

122 search results - page 9 / 25
» A Short Cut to Optimal Sequences
Sort
View
ESA
2003
Springer
95views Algorithms» more  ESA 2003»
15 years 2 months ago
Sequencing by Hybridization in Few Rounds
Sequencing by Hybridization (SBH) is a method for reconstructing an unknown DNA string based on obtaining, through hybridization experiments, whether certain short strings appear ...
Dekel Tsur
BMCBI
2010
132views more  BMCBI 2010»
14 years 9 months ago
Data structures and compression algorithms for high-throughput sequencing technologies
Background: High-throughput sequencing (HTS) technologies play important roles in the life sciences by allowing the rapid parallel sequencing of very large numbers of relatively s...
Kenny Daily, Paul Rigor, Scott Christley, Xiaohui ...
ICPPW
2005
IEEE
15 years 3 months ago
Gene Sequence Alignment on a Public Computing Platform
Public computing can potentially supply not only computational power but also memory and short term storage resources to grid and cluster scale problems. Gene sequence alignment i...
Stephen Pellicer, Nova Ahmed, Yi Pan, Yao Zheng
73
Voted
ICTAC
2009
Springer
15 years 2 months ago
A Formal Approach to Heuristically Test Restorable Systems
Abstract. Given a nite state machine denoting the specication of a system, nding some short interaction sequences capable to reach some/all states or transitions of this machine...
Pablo Rabanal, Ismael Rodríguez, Fernando R...
CDC
2008
IEEE
107views Control Systems» more  CDC 2008»
15 years 4 months ago
Locally optimal decomposition for autonomous obstacle avoidance with the Tunnel-MILP algorithm
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....