Sciweavers

192 search results - page 10 / 39
» Genome rearrangements with duplications
Sort
View
BMCBI
2008
125views more  BMCBI 2008»
14 years 10 months ago
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
Background: Due to recent progress in genome sequencing, more and more data for phylogenetic reconstruction based on rearrangement distances between genomes become available. Howe...
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohl...
FSTTCS
2003
Springer
15 years 3 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
ISAAC
2004
Springer
106views Algorithms» more  ISAAC 2004»
15 years 3 months ago
Minimum Common String Partition Problem: Hardness and Approximations
String comparison is a fundamental problem in computer science, with applications in areas such as computational biology, text processing or compression. In this paper we address t...
Avraham Goldstein, Petr Kolman, Jie Zheng
BMCBI
2007
154views more  BMCBI 2007»
14 years 10 months ago
Cinteny: flexible analysis and visualization of synteny and genome rearrangements in multiple organisms
Background: Identifying syntenic regions, i.e., blocks of genes or other markers with evolutionary conserved order, and quantifying evolutionary relatedness between genomes in ter...
Amit U. Sinha, Jaroslaw Meller
RECOMB
2003
Springer
15 years 10 months ago
Whole-genome comparative annotation and regulatory motif discovery in multiple yeast species
In [13] we reported the genome sequences of S. paradoxus, S. mikatae and S. bayanus and compared these three yeast species to their close relative, S. cerevisiae. Genome-wide comp...
Manolis Kamvysselis, Nick Patterson, Bruce Birren,...