Algorithms for the extraction of synteny blocks from comparative maps

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

Volumn 4645 LNBI, Issue , 2007, Pages 277-288

  Choi, Vicky ^a   Zheng, Chunfang ^b   Zhu, Qian ^b   Sankoff, David ^b  

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

^b UNIVERSITY OF OTTAWA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; CROPS; ERROR ANALYSIS; GENES; GRAPH THEORY; SET THEORY;

GENOME REARRANGEMENT ANALYSIS; MAXIMUM WEIGHT INDEPENDENT SET (MWIS); SYNTENY BLOCKS;

BIOINFORMATICS;

EID: 37249014401     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74126-8_26     Document Type: Conference Paper

References (9)

1. Choi, V.: BARNACLE: An assembly algorithm for clone-based sequences of whole genomes. Ph.D dissertation, Rutgers University (2002)
2. Corneil, D.G., Olariu, S., Stewart, L.: The LBFS structure and recognition of interval graphs. ms. cf: The ultimate interval graph recognition algorithm? In: SODA 1998, pp. 175-180 (2006)
3. Kumlander, D.: A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. ms. and poster. In: 4th European Congress of Mathematics (2005)
4. Liang, Y.D., Dhall, S.K., Lakshmivarahan, S.: On the problem of finding all maximum weight independent sets in interval and circular-arc graphs. IEEE Symposium on Applied Computing, 465-470 (1991)
5. Ostergard, P.R.J.: A new algorithm for the maximum-weight clique problem. Nordic Journal of Computing 8, 424-436 (2001)
6. Ostergard, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120, 195-205 (2002)
7. Tesler, G.: Efficient algorithms for multichromosomal genome rearrangements. Journal of Computer and System Sciences 65, 587-609 (2002)
8. Ware, D., Jaiswal, P., Ni, J., et al.: Gramene: a resource for comparative grass genomics. Nucleic Acids Research 30, 103-105 (2002)
9. Zheng, C., Zhu, Q., Sankoff, D.: Removing noise and ambiguities from comparative maps in rearrangement analysis. Transactions on Computational Biology and Bioinformatics (forth-coming, 2007), doi:10.1109/TCBB.2007.1075