Sciweavers

44 search results - page 7 / 9
» Algorithms for Multiple Genome Rearrangement by Signed Rever...
Sort
View
BMCBI
2011
12 years 11 months ago
Detection of recurrent rearrangement breakpoints from copy number data
Background: Copy number variants (CNVs), including deletions, amplifications, and other rearrangements, are common in human and cancer genomes. Copy number data from array compara...
Anna M. Ritz, Pamela L. Paris, Michael Ittmann, Co...
FCCM
2007
IEEE
117views VLSI» more  FCCM 2007»
14 years 1 months ago
FPGA Acceleration of Gene Rearrangement Analysis
In this paper we present our work toward FPGA acceleration of phylogenetic reconstruction, a type of analysis that is commonly performed in the fields of systematic biology and co...
Jason D. Bakos
DAM
2007
120views more  DAM 2007»
13 years 7 months ago
Advances on sorting by reversals
Theproblemofsortingsignedpermutationsbyreversalsisinspiredbygenomerearrangementproblemsincomputationalmolecular biology. Given two genomes represented as signed permutations of th...
Eric Tannier, Anne Bergeron, Marie-France Sagot
RECOMB
2008
Springer
14 years 7 months ago
Hurdles Hardly Have to Be Heeded
Abstract. As data about genomic architecture accumulates, genomic rearrangements have attracted increasing attention. One of the main rearrangement mechanisms, inversions (also cal...
Krister M. Swenson, Yu Lin, Vaibhav Rajan, Bernard...
EVOW
2008
Springer
13 years 9 months ago
Reactive Stochastic Local Search Algorithms for the Genomic Median Problem
Abstract. The genomic median problem is an optimization problem inspired by a biological issue: it aims at finding the chromosome organization of the common ancestor to multiple li...
Renaud Lenne, Christine Solnon, Thomas Stützl...