Removing noise and ambiguities from comparative maps in rearrangement analysis

IEEE/ACM Transactions on Computational Biology and Bioinformatics

Volumn 4, Issue 4, 2007, Pages 515-522

  Zheng, Chunfang ^a   Zhu, Qian ^a   Sankoff, David ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Enome rearrangements; Maximum weight clique; Rice; Sorghum; Synteny blocks

Indexed keywords

BIOMARKERS; CROPS; ERROR ANALYSIS; GENES; GENETIC ALGORITHMS;

ENOME REARRANGEMENTS; MAXIMUM WEIGHT CLIQUE (MWC); SYNTENY BLOCKS;

NOISE ABATEMENT;

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; CHROMOSOME MAP; COMPUTER SIMULATION; GENE REARRANGEMENT; GENETICS; GENOME; METHODOLOGY; PLANT CHROMOSOME; REPRODUCIBILITY; RICE; SORGHUM; SPECIES DIFFERENCE; STATISTICAL ANALYSIS; STATISTICAL MODEL;

ALGORITHMS; CHROMOSOME MAPPING; CHROMOSOMES, PLANT; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; DATA INTERPRETATION, STATISTICAL; GENE REARRANGEMENT; GENOME; GENOME, PLANT; MODELS, GENETIC; MODELS, STATISTICAL; ORYZA SATIVA; REPRODUCIBILITY OF RESULTS; SORGHUM; SPECIES SPECIFICITY;

EID: 36248971129     PISSN: 15455963     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCBB.2007.1075     Document Type: Conference Paper

References (11)

1. S. Arora, D. Karger, and M. Karpinski, "Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems," J. Computer and System Sciences, vol. 58, pp. 193-210, 1999.
2. J.E. Bowers, C. Abbey, S. Anderson, C. Chang, X. Draye, A.H. Hoppe, R. Jessup, C. Lemke, J. Lennington, Z. Li, Y.R. Lin, S.C Liu, L. Luo, B.S. Marier, R. Ming, S.E. Mitchell, D. Qiang, K. Reischmann, S.R. Schulze, D.N. Skinner, Y.W. Wang, S. Kresovich, K.F. Schertz, and A.H. Paterson, "A High-Density Genetic Recombination Map of Sequence-Tagged Sites for Sorghum, as a Framework for Comparative Structural, and Evolutionary Genomics of Tropical Grains and Grasses," Genetics, vol. 165, pp. 367-386, 2003.
3. Rice-Gramene Annotated Nipponbare Sequence, http:// www.gramene.org/ Oryza_sativa/, 2006.
4. S. Hannenhalli and P.A. Pevzner, "To Cut or Not to Cut (Applications of Comparative Physical Miaps in Molecular Evolution)," Proc. Seventh. Ann. ACM-SIAM Symp. Discrete Algorithms, pp. 304-313, 1996.
5. J. Kececioglu and D. Sankoff, "Exact and Approximation Algorithms for the Inversion Distance between Two Permutations," Proc Fourth Combinatorial Pattern Matching Symp., A. Apostolico, M!. Crochemore, Z. Galil, and U. Manber, eds., pp. 87-105, 1993,
6. full version in Algorithmica, vol. 13, pp. 180-210, 1995.
7. D. Kumlander, "A New Exact Algorithm for the MaximumWeight Clique Problem. Based on a Heuristic Vertex-Coloring and a Backtrack Search," Proc Fourth European Congress Math., 2005
8. G. Tesler, "Efficient Algorithms for Multichromosomal Genome Rearrangements," J. Computer and System Sciences, vol. 65, pp. 587-609, 2002.
9. D. Ware, P. Jaiswal, J. Ni, X. Pan, K. Chang, K. Clark, L. Teytelman, S. Schmidt, W. Zhao, S. Cartinhour, S. McCouch, and L. Stein, "Gramene: A Resource for Comparative Grass Genomics," Nucleic Acids Research, vol. 30, pp. 103-105, 2002.
10. S. Yancopoulos, O. Attie, and R. Friedberg, "Efficient Sorting of Genomic Permutations by Translocation, Inversion and Block Interchange," Bioinformatics, vol. 21, pp. 3340-3346, 2005.
11. C. Zheng and D. Sankoff, "Rearrangement of Noisy Genomes," Proc 2006 Int'l Workshop Bioinformatics Research and Applications. Part II, V.N. Alexandrov et al., eds., pp. 791-798, 2006.