메뉴 건너뛰기
Bioinformatics Algorithms: Techniques and Applications
Volumn , Issue , 2007, Pages 203-221
Integer Linear Programming Techniques for Discovering Approximate Gene Clusters
Author keywords

Approximate gene cluster discovery problem (AGCDP); Error tolerant formalization; Integer linear programs (ILPs)
Indexed keywords

EID: 84889493286     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470253441.ch9     Document Type: Chapter
Times cited : (4)
References (11)
  • 1
    • 84957010453 scopus 로고    scopus 로고
    • The algorithmic of gene teams
    • Workshop on Algorithms in Bioinformatics (WABI), of LNCS
    • Bergeron A, Corteel S, Raffinot M. The algorithmic of gene teams. Workshop on Algorithms in Bioinformatics (WABI), Vol. 2452 of LNCS; 2002. pp. 464-476.
    • (2002) , vol.2452 , pp. 464-476
    • Bergeron, A.1    Corteel, S.2    Raffinot, M.3
  • 2
    • 47249136517 scopus 로고    scopus 로고
    • On common intervals with errors
    • Technical Report 2006-02, Universität Bielefeld: Abteilung Informationstechnik, Technische Fakultät, ISSN 0946-7831
    • Chauve C, Diekmann Y, Heber S, Mixtacki J, Rahmann S, Stoye J. On common intervals with errors.Technical Report 2006-02, Universität Bielefeld: Abteilung Informationstechnik, Technische Fakultät; 2006. ISSN 0946-7831.
    • (2006)
    • Chauve, C.1    Diekmann, Y.2    Heber, S.3    Mixtacki, J.4    Rahmann, S.5    Stoye, J.6
  • 3
    • 0242606435 scopus 로고    scopus 로고
    • Tests for gene clustering
    • Durand D, Sankoff D. Tests for gene clustering. J Comput Biol 2003;10(3-4):453-482.
    • (2003) J Comput Biol , vol.10 , Issue.3-4 , pp. 453-482
    • Durand, D.1    Sankoff, D.2
  • 4
    • 51249185617 scopus 로고
    • The ellipsoid method and its consequences in combinatorial optimization
    • Grötschel M, Lovász L, Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1981;1:169-197.
    • (1981) Combinatorica , vol.1 , pp. 169-197
    • Grötschel, M.1    Lovász, L.2    Schrijver, A.3
  • 5
    • 84959048279 scopus 로고    scopus 로고
    • Algorithms for finding gene clusters
    • Gascuel O, Moret B, editors, Proceedings of the First International Workshop on Algorithms in Bioinformatics, WABI 01, of Lecture Notes in Computer Science. Berlin: Springer Verlag
    • Heber S, Stoye J. Algorithms for finding gene clusters. In: Gascuel O, Moret B, editors. Proceedings of the First International Workshop on Algorithms in Bioinformatics, WABI 01, Vol. 2149 of Lecture Notes in Computer Science. Berlin: Springer Verlag; 2001. pp. 252-263.
    • (2001) , vol.2149 , pp. 252-263
    • Heber, S.1    Stoye, J.2
  • 6
    • 33344465083 scopus 로고    scopus 로고
    • The incompatible desiderata of gene cluster properties
    • McLysaght A, Huson DH, editors, Comparative Genomics: RECOMB 2005 International Workshop, of LNCS
    • Hoberman R, Durand D. The incompatible desiderata of gene cluster properties. In: McLysaght A, Huson DH, editors. Comparative Genomics: RECOMB 2005 International Workshop, Vol. 3678 of LNCS; 2005. pp. 73-87.
    • (2005) , vol.3678 , pp. 73-87
    • Hoberman, R.1    Durand, D.2
  • 7
    • 84889291862 scopus 로고
    • ILOG, Inc. CPLEX
    • ILOG, Inc. CPLEX. http://www.ilog.com/products/cplex, 1987-2006.
    • (1987)
  • 8
    • 17844372663 scopus 로고    scopus 로고
    • Genome-scale analysis of positional clustering of mouse testisspecific genes
    • Li Q, Lee BTK, Zhang L. Genome-scale analysis of positional clustering of mouse testisspecific genes. BMC Genomics 2005;6(1):7.
    • (2005) BMC Genomics , vol.6 , Issue.1 , pp. 7
    • Li, Q.1    Lee, B.T.K.2    Zhang, L.3
  • 9
    • 33750244990 scopus 로고    scopus 로고
    • Integer linear programs for discovering approximate gene clusters
    • Bucher P, Moret B, editors, Proceedings of the 6th Workshop on Algorithms in Bioinformatics (WABI), of LNBI; Springer
    • Rahmann S, Klau GW. Integer linear programs for discovering approximate gene clusters. In: Bucher P, Moret B, editors. Proceedings of the 6th Workshop on Algorithms in Bioinformatics (WABI), Vol. 4175 of LNBI; Springer; 2006. pp. 298-309.
    • (2006) , vol.4175 , pp. 298-309
    • Rahmann, S.1    Klau, G.W.2
  • 10
    • 35048821961 scopus 로고    scopus 로고
    • Quadratic time algorithms for finding common intervals in two and more sequences
    • Sahinalp SC, Muthukrishnan S, Dogrusoz U, editors, Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004, of LNCS
    • Schmidt T, Stoye J. Quadratic time algorithms for finding common intervals in two and more sequences. In: Sahinalp SC, Muthukrishnan S, Dogrusoz U, editors. Proceedings of the 15th Annual Symposium on Combinatorial Pattern Matching, CPM 2004, Vol. 3109 of LNCS, 2004. pp. 347-358.
    • (2004) , vol.3109 , pp. 347-358
    • Schmidt, T.1    Stoye, J.2
  • 11
    • 13444307369 scopus 로고    scopus 로고
    • Integer programming.Wiley Interscience Series in Discrete Mathematics and Optimization
    • John Wiley & Sons
    • Wolsey LA. Integer programming.Wiley Interscience Series in Discrete Mathematics and Optimization. John Wiley & Sons; 1998.
    • (1998)
    • Wolsey, L.A.1

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.