Sciweavers

6 search results - page 1 / 2
» Inapproximability of Maximal Strip Recovery
Sort
View
AAIM
2010
Springer
181views Algorithms» more  AAIM 2010»
15 years 1 months ago
Efficient Exact and Approximate Algorithms for the Complement of Maximal Strip Recovery
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
Binhai Zhu
ISAAC
2009
Springer
127views Algorithms» more  ISAAC 2009»
15 years 4 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
63
Voted
TAMC
2009
Springer
15 years 4 months ago
On the Tractability of Maximal Strip Recovery
Lusheng Wang, Binhai Zhu
COCOA
2008
Springer
15 years 3 days 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