Sciweavers

95 search results - page 1 / 19
» Algorithms for the Extraction of Synteny Blocks from Compara...
Sort
View
WABI
2007
Springer
122views Bioinformatics» more  WABI 2007»
13 years 11 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...
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
13 years 11 months ago
Maximal Strip Recovery Problem with Gaps: Hardness and Approximation Algorithms
Abstract. Given two comparative maps, that is two sequences of markers each representing a genome, the Maximal Strip Recovery problem (MSR) asks to extract a largest sequence of ma...
Laurent Bulteau, Guillaume Fertin, Irena Rusu
RECOMB
2003
Springer
14 years 5 months ago
Transforming men into mice: the Nadeau-Taylor chromosomal breakage model revisited
Although analysis of genome rearrangements was pioneered by Dobzhansky and Sturtevant 65 years ago, we still know very little about the rearrangement events that produced the exis...
Pavel A. Pevzner, Glenn Tesler
COCOA
2008
Springer
13 years 6 months ago
On Recovering Syntenic Blocks from Comparative Maps
A genomic map is represented by a sequence of gene markers, and a gene marker can appear in several different genomic maps, in either positive or negative form. A strip (syntenic b...
Zhixiang Chen, Bin Fu, Minghui Jiang, Binhai Zhu
CEAS
2004
Springer
13 years 10 months ago
Learning to Extract Signature and Reply Lines from Email
: We describe methods for automatically identifying signature blocks and reply lines in plaintext email messages. This analysis has many potential applications, such as preprocessi...
Vitor Rocha de Carvalho, William W. Cohen