Sciweavers

2994 search results - page 65 / 599
» Time sequences
Sort
View
BMCBI
2007
148views more  BMCBI 2007»
13 years 9 months ago
Blast sampling for structural and functional analyses
Background: The post-genomic era is characterised by a torrent of biological information flooding the public databases. As a direct consequence, similarity searches starting with ...
Anne Friedrich, Raymond Ripp, Nicolas Garnier, Emm...
SODA
1997
ACM
144views Algorithms» more  SODA 1997»
13 years 10 months ago
Methods for Achieving Fast Query Times in Point Location Data Structures
Given a collection S of n line segments in the plane, the planar point location problem is to construct a data structure that can e ciently determine for a given query point p the...
Michael T. Goodrich, Mark W. Orletsky, Kumar Ramai...
BMCBI
2007
153views more  BMCBI 2007»
13 years 9 months ago
Lower bounds on multiple sequence alignment using exact 3-way alignment
Background: Multiple sequence alignment is fundamental. Exponential growth in computation time appears to be inevitable when an optimal alignment is required for many sequences. E...
Charles J. Colbourn, Sudhir Kumar
COCOA
2007
Springer
14 years 3 months ago
A Lagrangian Relaxation Approach for the Multiple Sequence Alignment Problem
Abstract. We present a branch-and-bound (bb) algorithm for the multiple sequence alignment problem (MSA), one of the most important problems in computational biology. The upper bou...
Ernst Althaus, Stefan Canzar
ISQED
2002
IEEE
85views Hardware» more  ISQED 2002»
14 years 1 months ago
Optimal Sequencing Energy Allocation for CMOS Integrated Systems
All synchronous CMOS integrated systems have to pay some sequencing overhead. This overhead includes the skew and the jitter of the clock. It also includes the setup time and the ...
Martin Saint-Laurent, Vojin G. Oklobdzija, Simon S...