Natural parameter values for generalized gene adjacency

Journal of Computational Biology

Volumn 17, Issue 9, 2010, Pages 1113-1128

  Yang, Zhenyu ^a   Sankoff, David ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

Author keywords

algorithms; genomic rearrangements; molecular evolution; sequence analysis; statistics

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CHROMOSOME MAP; COMPUTER SIMULATION; DNA SEQUENCE; GENOME; MATHEMATICS; MOLECULAR EVOLUTION; MULTIGENE FAMILY;

ALGORITHMS; CHROMOSOME MAPPING; COMPUTER SIMULATION; EVOLUTION, MOLECULAR; GENOME; MATHEMATICS; MODELS, GENETIC; MULTIGENE FAMILY; SEQUENCE ANALYSIS, DNA;

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

References (9)

1. Chinn, P. Z., Chvátalová, J., Dewdney, A. K., et al. 2006. The bandwidth problem for graphs and matrices-a survey. J. Graph Theory 6, 223-254.
2. D'Souza, R., Achlioptas, D., and Spencer, J. 2009. Explosive percolation in random networks. Science 323, 1453-1455.
3. Erdös, P., and Rényi, A. 1959. On random graphs. Publ. Math. 6, 290-297.
4. Erdös, P., and Rényi, A. 1960. On the evolution of random graphs. Publ. Math. Instit. Hung. Acad. Sci. 5, 17-61.
5. Erdös, P., and Rényi, A. 1961. On the strength of connectedness of a random graphs. Acta Math. Sci. Hung. 12, 261-267.
6. Hoberman, R., and Durand, D. 2005. The incompatible desiderata of gene cluster properties. Lect. Notes Bioinform. 3678, 73-87.
7. Hoberman, R., Sankoff, D., and Durand, D. 2005. The statistical analysis of spatially clustered genes under the maximum gap criterion. J. Comput. Biol. 12, 1081-1100.
8. Xu, X., and Sankoff, D. 2008. Tests for gene clusters satisfying the generalized adjacency criterion. Lect. Notes Bioinform. 5167, 152-160.
9. Zhu, Q., Adam, Z., Choi, V., et al. 2009. Generalized gene adjacencies, graph bandwidth, and clusters in yeast evolution. Trans. Comput. Biol. Bioinform. 6, 213-220.