Computation of median gene clusters

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

Volumn 4955 LNBI, Issue , 2008, Pages 331-345

  Böcker, Sebastian ^a   Jahn, Katharina ^b   Mixtacki, Julia ^b   Stoye, Jens ^b  

^a FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

^b BIELEFELD UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BIOCHEMISTRY; COMPUTATIONAL COMPLEXITY; MOLECULAR BIOLOGY; MOLECULAR STRUCTURE;

COMPARATIVE GENOMICS; COMPUTATIONAL MOLECULAR BIOLOGY; EFFICIENT ALGORITHMS; EQUALITY CONSTRAINTS; GENE CLUSTERING; GENE CONTENT; GENOME COMPARISONS; HEIDELBERG (CO); INTERNATIONAL CONFERENCES; SETS OF GENES;

BIOLOGY;

EID: 47249160776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78839-3_28     Document Type: Conference Paper

References (15)

1. Amir, A., Gasieniec, L., Shalom, R.: Improved approximate common interval. Inf. Process. Lett. 103(4), 142-149 (2007)
2. Bergeron, A., Chauve, C., de Mongolfier, F., Raffinot, M.: Computing common intervals of k permutations, with applications to modular decomposition of graphs. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 779-790. Springer, Heidelberg (2005)
3. 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)
4. Chauve, C., Diekmann, Y., Heber, S., Mixtacki, J., Rahmann, S., Stoye, J.: On common intervals with errors. Report 2006-02, Technische Fakultät der Universität Bielefeld, Abteilung Informationstechnik (2006)
5. Dandekar, T., Snel, B., Huynen, M., Bork, P.: Conservation of gene order: a fingerprint of proteins that physically interact. Trends Biochem. Sci. 23(9), 324-328 (1998)
6. Didier, G., Schmidt, T., Stoye, J., Tsur, D.: Character sets of strings. J. Discr. Alg. 5, 330-340 (2007)
7. Frances, M., Litman, A.: On covering problems of codes. Theor. Comput. Sci. 30, 119-133 (1997)
8. Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25-42 (2003)
9. He, X., Goldwasser, M.H.: Identifying conserved gene clusters in the presence of homology families. J. Comp. Biol. 12, 638-656 (2005)
10. Heber, S., Stoye, J.: Algorithms for finding gene clusters. In: Gascuel, O., Moret, B.M.E. (eds.) WABI 2001. LNCS, vol. 2149, pp. 252-263. Springer, Heidelberg (2001)
11. Heber, S., Stoye, J.: Finding all common intervals of k permutations. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 207-218. Springer, Heidelberg (2001)
12. Hoberman, R., Durand, D.: The incompatible desiderata of gene cluster properties. In: McLysaght, A., Huson, D.H. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3678, pp. 73-87. Springer, Heidelberg (2005)
13. Rahmann, S., Klau, G.W.: Integer linear programs for discovering approximate gene clusters. In: Bücher, P., Moret, B.M.E. (eds.) WABI 2006. LNCS (LNBI), vol. 4175, pp. 298-309. Springer, Heidelberg (2006)
14. Schmidt, T., Stoye, J.: Quadratic time algorithms for finding common intervals in two and more sequences. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 347-358. Springer, Heidelberg (2004)
15. Uno, T., Yagiura, M.: Fast algorithms to enumerate all common intervals of two permutations. Algorithmica 26, 290-309 (2000)