14 search results - page 1 / 3 » Pseudo Boolean Programming for Partially Ordered Genomes |
RECOMB
2009
Springer
14 years 4 months ago
2009
Springer
Comparing genomes of different species is a crucial problem in comparative genomics. Different measures have been proposed to compare two genomes: number of common intervals, num...
JSAT
2006
13 years 9 months ago
2006
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
ALMOB
2008
13 years 9 months ago
2008
Background: Identification of homologous regions or conserved syntenies across genomes is one crucial step in comparative genomics. This task is usually performed by genome alignm...
RECOMB
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...