Generalized gene adjacencies, graph bandwidth and clusters in yeast evolution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4983 LNBI, Issue , 2008, Pages 134-145

  Zhu, Qian ^a   Adam, Zaky ^a   Choi, Vicky ^b   Sankoff, David ^a  

^a UNIVERSITY OF OTTAWA   (Canada)

^b Virginia Polytechnic Institute and State University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GENE CLUSTERING; INTERNATIONAL SYMPOSIUM; PHYLOGENETIC TREES; PROGRAMMING OPTIMIZATION;

BIOCOMMUNICATIONS; BIOINFORMATICS; GRAPH THEORY; INFORMATION SCIENCE; MATHEMATICAL PROGRAMMING; SYSTEMS ENGINEERING; TELECOMMUNICATION SYSTEMS; YEAST;

CHLORINE COMPOUNDS;

EID: 49949104673     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-79450-9_13     Document Type: Conference Paper

References (10)

1. Bergeron, A., Corteel, S., Raffinot, M.: The algorithmic of gene teams. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 464-476. Springer, Heidelberg (2002)
2. Blum, A., Konjevod, G., Ravi, R., Vempala, S.: Semi-definite relaxations for minimum bandwidth and other vertex-ordering problems. In: Proceedings of the 30th ACM Symposium on the Theory of Computing, pp. 95-100 (1997)
3. Byrne, K.P., Wolfe, K.H.: The Yeast Gene Order Browser: combining curated homology and syntenic context reveals gene fate in polyploid species. Genome Research 15, 1456-1461 (2005)
4. Cuthill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the 24th National Conference of the ACM, pp. 157-172 (1969)
5. Felsenstein, J.: Inferring phylogenies. Sinauer Associates, Sunderland, MA (2004)
6. George, A.: Computer implementation of the finite element method, STAN-CS-71-208, Computer Science Dept., Stanford Univ., Stanford, CA (1971)
7. Hoberman, R., Sankoff, D., Durand, D.: The statistical analysis of spatially clustered genes under the maximum gap criterion. Journal of Computational Biology 12, 1081-1100 (2005)
8. Liu, J., Sherman, A.: Comparative analysis of the Cuthill-Mckee and the reverse Cuthill-Mckee ordering algorithms for sparse matrices. SIAM Journal of Numerical Analysis 13, 198-213 (1975)
9. Papadimitriou, C.H.: The NP-completeness of the bandwidth minimization problem. Computing 16, 263-270 (1976)
10. Saxe, J.: Dynamic-programming algorithms for recognizing small-band-width graphs in polynomial time. SIAM Journal of Algebraic and Discrete Methods 1, 363-369 (1980)