Sciweavers

2455 search results - page 5 / 491
» Computability of Models for Sequence Assembly
Sort
View
IFIP
2004
Springer
14 years 1 months ago
Efficient Algorithms for Handling Molecular Weighted Sequences
Abstract In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Wei...
Costas S. Iliopoulos, Christos Makris, Yannis Pana...
IROS
2006
IEEE
136views Robotics» more  IROS 2006»
14 years 2 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
BMCBI
2008
104views more  BMCBI 2008»
13 years 8 months ago
ReRep: Computational detection of repetitive sequences in genome survey sequences (GSS)
Background: Genome survey sequences (GSS) offer a preliminary global view of a genome since, unlike ESTs, they cover coding as well as non-coding DNA and include repetitive region...
Thomas D. Otto, Leonardo H. F. Gomes, Marcelo Alve...
SCFBM
2008
91views more  SCFBM 2008»
13 years 8 months ago
Simple tools for assembling and searching high-density picolitre pyrophosphate sequence data
Background: The advent of pyrophosphate sequencing makes large volumes of sequencing data available at a lower cost than previously possible. However, the short read lengths are d...
Nicolas J. Parker, Andrew G. Parker
BMCBI
2010
133views more  BMCBI 2010»
13 years 8 months ago
Improving de novo sequence assembly using machine learning and comparative genomics for overlap correction
Background: With the rapid expansion of DNA sequencing databases, it is now feasible to identify relevant information from prior sequencing projects and completed genomes and appl...
Lance E. Palmer, Mathäus Dejori, Randall A. B...