Rearrangement of Noisy Genomes
Measures of distance between genomic maps are inflated by high levels of noise due to incorrectly resolved paralogy and error at the mapping, sequencing and alignment levels. Comparison is also hampered by lack of information on gene orientation and lack gene order. We suggest a suite of algorithms for genome rearrangement analysis in the presence of noise and incomplete information, and test its robustness as noise levels increase.
KeywordsPolynomial Time Breakpoint Graph Alignment Level Compatibility Graph Strip Analysis
- 2.Caprara, A.: Sorting by reversals is difficult. In: RECOMB 1997, pp. 75–83 (1997)Google Scholar
- 3.Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). STOC 27, 178–189 (1995)Google Scholar
- 6.Kumlander, D.: A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. Fourth European Congress of Mathematics. Poster and manuscript (2005)Google Scholar