Sciweavers

61 search results - page 3 / 13
» Comparing Bacterial Genomes by Searching Their Common Interv...
Sort
View
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
15 years 3 months ago
Algorithms for the Extraction of Synteny Blocks from Comparative Maps
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
Vicky Choi, Chunfang Zheng, Qian Zhu, David Sankof...
113
Voted
BMCBI
2011
14 years 1 months ago
Improving pan-genome annotation using whole genome multiple alignment
Background: Rapid annotation and comparisons of genomes from multiple isolates (pan-genomes) is becoming commonplace due to advances in sequencing technology. Genome annotations c...
Samuel V. Angiuoli, Julie C. Dunning Hotopp, Steve...
80
Voted
RECOMB
2009
Springer
15 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...
86
Voted
RECOMB
2008
Springer
15 years 9 months ago
Perfect DCJ Rearrangement
We study the problem of transforming a multichromosomal genome into another using Double-Cut-and-Join (DCJ) operations. We introduce the notion of DCJ scenario that does not break ...
Sèverine Bérard, Annie Chateau, Cedr...
APBC
2004
14 years 11 months ago
Variable-length Intervals in Homology Search
Fast, accurate, and scalable search techniques for homology searching of large genomic collections are becoming an increasingly important requirement as genomic sequence collectio...
Abhijit Chattaraj, Hugh E. Williams