Sciweavers

426 search results - page 27 / 86
» Run lengths and liquidity
Sort
View
RECOMB
2010
Springer
13 years 7 months ago
Listing All Parsimonious Reversal Sequences: New Algorithms and Perspectives
In comparative genomics studies, finding a minimum length sequences of reversals, so called sorting by reversals, has been the topic of a huge literature. Since there are many mini...
Ghada Badr, Krister M. Swenson, David Sankoff
ISCAS
2006
IEEE
108views Hardware» more  ISCAS 2006»
14 years 3 months ago
A low complexity hardware architecture for motion estimation
This paper tackles the problem of accelerating The rest of this paper is organised as follows: section II motion estimation for video processing. A novel architecture details relat...
Daniel Larkin, Vlenti. Muresan, Noel E. O'Connor
FOCS
2002
IEEE
14 years 2 months ago
Optimal System of Loops on an Orientable Surface
Every compact orientable boundaryless surface M can be cut along simple loops with a common point v0, pairwise disjoint except at v0, so that the resulting surface is a topologica...
Éric Colin de Verdière, Francis Laza...
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
14 years 1 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
SODA
2007
ACM
131views Algorithms» more  SODA 2007»
13 years 11 months ago
On the K-simple shortest paths problem in weighted directed graphs
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Liam Roditty