520 search results - page 15 / 104 » Computing recombination networks from binary sequences |
IWANN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. ZARAMIT is an information system capable of fully automated phylogeny reconstruction. Methods have been tailored to mitochondrial DNA sequences, with focus on subproblem ...
DCC
2007
IEEE
15 years 9 months ago
2007
IEEE
Constructions and nonexistence conditions for multi-dimensional Golay complementary array pairs are reviewed. A construction for a d-dimensional Golay array pair from a (d + 1)-di...
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
In this paper, we show that in a multi-camera context, we can effectively handle occlusions in real-time at each frame independently, even when the only available data comes from ...
ESA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We show that optimal alphabetic binary trees can be constructed in O(n) time if the elements of the initial sequence are drawn from a domain that can be sorted in linear ...
TCS
1998
14 years 9 months ago
1998
Abstract. We show that Turyn’s conjecture, arising from the Theory of Error Correcting Codes, has an equivalent formulation in Dynamical Systems Theory. In particular, Turyn’s ...