314 search results - page 44 / 63 » Computing all Suboptimal Alignments in Linear Space |
COMPGEOM
2010
ACM
14 years 17 days ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
PPOPP
2010
ACM
13 years 9 months ago
2010
ACM
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
BMCBI
2005
13 years 7 months ago
2005
Background: All eukaryotic organisms need to distinguish each of their chromosomes. A few protein complexes have been described that recognise entire, specific chromosomes, for in...
CPM
2007
Springer
14 years 1 months ago
2007
Springer
We consider the two-dimensional Range Minimum Query problem: for a static (m × n)-matrix of size N = mn which may be preprocessed, answer on-line queries of the form “where is t...
BIRTHDAY
2009
Springer
14 years 2 months ago
2009
Springer
Any mapping S : C → K, where K is a field and C = (C, Σ) is a Σ-algebra, is called a KC-series. These series are natural generalizations of both formal series on strings over...