Sciweavers

14 search results - page 1 / 3
» Pseudo Boolean Programming for Partially Ordered Genomes
Sort
View
RECOMB
2009
Springer
14 years 4 months ago
Pseudo Boolean Programming for Partially Ordered Genomes
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...
Sébastien Angibaud, Guillaume Fertin, Annel...
JSAT
2006
134views more  JSAT 2006»
13 years 9 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
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...
Hossein M. Sheini, Karem A. Sakallah
ALMOB
2008
160views more  ALMOB 2008»
13 years 9 months ago
Syntenator: Multiple gene order alignments with a gene-specific scoring function
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...
Christian Rödelsperger, Christoph Dieterich
RECOMB
2006
Springer
14 years 9 months ago
Inferring Gene Orders from Gene Maps Using the Breakpoint Distance
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
Guillaume Blin, Eric Blais, Pierre Guillon, Mathie...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 9 months ago
Symmetry Breaking for Maximum Satisfiability
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
João Marques-Silva, Inês Lynce, Vasco...