Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction

Journal of Computational Biology

Volumn 17, Issue 9, 2010, Pages 1167-1181

  Chauve, Cedric ^a   Haus, Utz Uwe ^b   Stephen, Tamon ^a   You, Vivija P ^a  

^a SIMON FRASER UNIVERSITY   (Canada)

^b OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

algorithms; combinatorics; computational molecular biology; genomic rearrangements; RNA

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; BIOLOGY; COMPUTER SIMULATION; GENETIC MARKER; GENETICS; GENOME; GENOMICS; METHODOLOGY; MOLECULAR EVOLUTION; PHYLOGENY; YEAST;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; GENETIC MARKERS; GENOME; GENOMICS; MODELS, GENETIC; PHYLOGENY; YEASTS;

SACCHAROMYCETACEAE;

EID: 77958074415     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2010.0113     Document Type: Article

References (31)

1. Adam, Z., Turmel, M., Lemieux, C., et al. 2007. Common intervals and symmetric difference in a model-free phylogenomics, with an application to streptophyte evolution. J. Comput. Biol. 14, 436-445.
2. Alizadeh, F., Karp, R., Weisser, D., et al. 1995. Physical mapping of chromosomes using unique probes. J. Comput. Biol. 2, 159-184.
3. Bergeron, A., Blanchette, M., Chateau, A., et al. 2004. Reconstructing ancestral gene orders using conserved intervals. Lect. Notes Comput. Sci. 3240, 14-25.
4. Bergeron, A., Chauve, C., and Gingras, Y. 2008. Formal models of gene clusters, 177-202. In Zelikovsky, A., and Mandoiu, I., eds, Bioinformatics Algorithms: Techniques and Applications. Wiley Series on Bioinformatics: Computational Techniques and Engineering. Wiley Interscience, New York.
5. Booth, K. S., and Lueker, G. S. 1976. Testing for the consecutive ones property, interval graphs, and graph planarity. J. Comput. Syst. Sci. 13, 335-379.
6. Chauve, C., Haus, U.-U., Stephen, T., et al. 2009. Minimal Conflicting Sets for the Consecutive Ones Property in Ancestral Genome Reconstruction, Lect. Notes Comput. Sci. 5817, 48-58.
7. Chauve, C., and Tannier, E. 2008. A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput. Biol. 4, paper e1000234.
8. Chauve, C., Gavranovic, H., Ouangraoua, A., et al. Yeasts ancestral genome reconstructions: the possibilities of computational methods. J. Comput. Biol. 17, 1097-1112 (this issue).
9. Christof, T., Jünger, M., Kececioglu, J., et al. 1997. A branch-and-cut approach to physical mapping of chromosome by unique end-probes. J. Comput. Biol. 4, 433-447.
10. Dom, M. 2008. Recognition, generation, and application of binary matrices with the consecutive-ones property. [Dissertation]. Institut für Informatik, Friedrich-Schiller-Universität, Jena.
11. Dom, M. 2009. Algorithmic aspects of the consecutive-ones property. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS 98, 27-59.
12. Eiter, T., Makino, K., and Gottlob, G. 2008. Computational aspects of monotone dualization: a brief survey. Disc. Appl. Math. 156, 2035-2049.
13. Fredman, M. L., and Khachiyan, L. 1996. On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21, 618-628.
14. Goldberg, P. W., Golumbic, M. C., Kaplan, H., et al. 1995. Four strikes against physical mapping of DNA J. Comput. Biol. 2, 139-152.
15. Gunopulos, D., Khardon, R., Mannila, H., et al. 1997. Data mining, hypergraph transversals and machine learning. Proc. PODS 1997 209-216.
16. Gurvich, V., and Khachiyan, L. 1999. On generating the irredundant conjunctive and disjunctive normal forms of monotone Boolean functions. Disc. Appl. Math. 96/97, 363-373.
17. Habib, M., McConnell, R. M., Paul, C., et al. 2000. Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci. 234, 59-84.
18. Haus, U.-U., and Stephen, T. 2008. CL-JOINTGEN: a common lisp implementation of the joint generation method. Available at: http://primaldual.de/cl-jointgen/. Accessed July 1, 2010.
19. Haus, U.-U., Klamt, S., and Stephen, T. 2008. Computing knock out strategies in metabolic networks J. Comput. Biol. 15, 259-268.
20. Hsu, W.-L. 2002. A simple test for the consecutive ones property. J. Algorithms 43, 1-16.
21. Jerrum, M. R., Valiant, L. G., and Vazirani, V. Y. 1986. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169-188.
22. Lu, W.-F., and Hsu, W.-L. 2003. A test for the consecutive ones property on noisy data-application to physical mapping and sequence assembly. J. Comput. Biol. 10, 709-735.
23. Ma, J., et al. 2006. Reconstructing contiguous regions of an ancestral genome. Genome Res. 16, 1557-1565.
24. McConnell, R. M. 2004. A certifying algorithm for the consecutive-ones property. Proc. SODA 2004 761-770.
25. Meidanis, J., Porto, O., and Telle, G. P. 1998. On the consecutive ones property. Discrete Appl. Math. 88, 325-354.
26. Ouangraoua, A., Boyer, F., McPherson, A., et al. 2009. Prediction of contiguous ancestral regions in the amniote ancestral genome. Lect. Notes Comput. Sci. 5542, 173-185.
27. Read, R. C., and Tarjan, R. E. 1975. Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237-252.
28. Stoye, J., and Wittler, R. 2009. A unified approach for reconstructing ancient gene clusters. IEEE/ACM Trans. Comput. Biol. Bioinf. 6, 387-400.
29. Tucker, A. C. 1972. A structure theorem for the consecutive 1's property. J. Combinat. Theory B 12, 153-162.
30. Valiant, L. G. 1979. The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410-421.
31. You, V. P. 2009. On matrices that do not have the consecutive ones property. [M. Sc. Thesis]. Department of Mathematics, Simon Fraser University.