메뉴 건너뛰기




Volumn 5817 LNBI, Issue , 2009, Pages 48-58

Minimal conflicting sets for the consecutive ones property in ancestral genome reconstruction

Author keywords

[No Author keywords available]

Indexed keywords

ANCESTRAL GENOMES; BINARY MATRIX; COMBINATORIAL STRUCTURES; COMPARATIVE GENOMICS; CONSECUTIVE ONES PROPERTY; EFFICIENT ALGORITHM; MATRIX; MONOTONE BOOLEAN FUNCTIONS; POLYNOMIAL TIME COMPLEXITY; SIMULATED DATA; SUB-MATRICES;

EID: 78651233728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04744-2_5     Document Type: Conference Paper
Times cited : (10)

References (25)
  • 1
    • 34250303500 scopus 로고    scopus 로고
    • Common intervals and symmetric difference in a model-free phylogenomics, with an application to streptophyte evolution
    • Adam, Z., Turmel, M., Lemieux, C., Sankoff, D.: Common intervals and symmetric difference in a model-free phylogenomics, with an application to streptophyte evolution. J. Comput. Biol. 14, 436-445 (2007)
    • (2007) J. Comput. Biol. , vol.14 , pp. 436-445
    • Adam, Z.1    Turmel, M.2    Lemieux, C.3    Sankoff, D.4
  • 2
    • 0029312686 scopus 로고
    • Physical mapping of chromosomes using unique probes
    • Alizadeh, F., Karp, R., Weisser, D., Zweig, G.: Physical mapping of chromosomes using unique probes. J. Comput. Biol. 2, 159-184 (1995)
    • (1995) J. Comput. Biol. , vol.2 , pp. 159-184
    • Alizadeh, F.1    Karp, R.2    Weisser, D.3    Zweig, G.4
  • 3
    • 35048875232 scopus 로고    scopus 로고
    • Reconstructing ancestral gene orders using conserved intervals
    • Jonassen, I., Kim, J. (eds.). Springer, Heidelberg
    • Bergeron, A., Blanchette, M., Chateau, A., Chauve, C.: Reconstructing ancestral gene orders using conserved intervals. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol. 3240, pp. 14-25. Springer, Heidelberg (2004)
    • (2004) WABI 2004. LNCS (LNBI) , vol.3240 , pp. 14-25
    • Bergeron, A.1    Blanchette, M.2    Chateau, A.3    Chauve, C.4
  • 4
    • 0017216776 scopus 로고
    • Testing for the consecutive ones property, interval graphs, and graph planarity
    • Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity. J. Comput. Syst. Sci. 13, 335-379 (1976)
    • (1976) J. Comput. Syst. Sci. , vol.13 , pp. 335-379
    • Booth, K.S.1    Lueker, G.S.2
  • 5
    • 57149085266 scopus 로고    scopus 로고
    • A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome
    • Chauve, C., Tannier, E.: A methodological framework for the reconstruction of contiguous regions of ancestral genomes and its application to mammalian genome. PLoS Comput. Biol. 4, e1000234 (2008)
    • (2008) PLoS Comput. Biol. , vol.4
    • Chauve, C.1    Tannier, E.2
  • 6
    • 0030722716 scopus 로고    scopus 로고
    • A branch-and-cut approach to physical mapping of chromosome by unique end-probes
    • Christof, T., Jünger, M., Kececioglu, J., Mutzel, P., Reinelt, G.: A branch-and-cut approach to physical mapping of chromosome by unique end-probes. J. Comput. Biol. 4, 433-447 (1997)
    • (1997) J. Comput. Biol. , vol.4 , pp. 433-447
    • Christof, T.1    Jünger, M.2    Kececioglu, J.3    Mutzel, P.4    Reinelt, G.5
  • 8
    • 47549090600 scopus 로고    scopus 로고
    • Computational aspects of monotone dualization: A brief survey
    • Eiter, T., Makino, K., Gottlob, G.: Computational aspects of monotone dualization: A brief survey. Disc. Appl. Math. 156, 2035-2049 (2008)
    • (2008) Disc. Appl. Math. , vol.156 , pp. 2035-2049
    • Eiter, T.1    Makino, K.2    Gottlob, G.3
  • 9
    • 0000039971 scopus 로고    scopus 로고
    • On the complexity of dualization of monotone disjunctive normal forms
    • Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21, 618-628 (1996)
    • (1996) J. Algorithms , vol.21 , pp. 618-628
    • Fredman, M.L.1    Khachiyan, L.2
  • 11
    • 0030642745 scopus 로고    scopus 로고
    • Data mining, hypergraph transversals and machine learning
    • ACM, New York
    • Gunopulos, D., Khardon, R., Mannila, H., Toivonen, H.: Data mining, hypergraph transversals and machine learning. In: PODS 1997, pp. 209-216. ACM, New York (1997)
    • (1997) PODS 1997 , pp. 209-216
    • Gunopulos, D.1    Khardon, R.2    Mannila, H.3    Toivonen, H.4
  • 12
    • 17944387346 scopus 로고    scopus 로고
    • On generating the ireedundant conjunctive and disjunctive normal forms of monotone Boolean functions
    • Gurvich, V., Khachiyan, L.: On generating the ireedundant conjunctive and disjunctive normal forms of monotone Boolean functions. Disc. Appl. Math. 96-97, 363-373 (1999)
    • (1999) Disc. Appl. Math. , vol.96-97 , pp. 363-373
    • Gurvich, V.1    Khachiyan, L.2
  • 13
    • 0002482188 scopus 로고    scopus 로고
    • Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing
    • Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci. 234, 59-84 (2000)
    • (2000) Theoret. Comput. Sci. , vol.234 , pp. 59-84
    • Habib, M.1    McConnell, R.M.2    Paul, C.3    Viennot, L.4
  • 15
    • 0036557484 scopus 로고    scopus 로고
    • A simple test for the consecutive ones porperty
    • Hsu, W.-L.: A simple test for the Consecutive Ones Porperty. J. Algorithms 43, 1-16 (2002)
    • (2002) J. Algorithms , vol.43 , pp. 1-16
    • Hsu, W.-L.1
  • 16
    • 38249043088 scopus 로고
    • Random generation of combinatorial structures from a uniform distribution
    • Jerrum, M.R., Valiant, L.G., Vazirani, V.Y.: Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169-188 (1986)
    • (1986) Theoret. Comput. Sci. , vol.43 , pp. 169-188
    • Jerrum, M.R.1    Valiant, L.G.2    Vazirani, V.Y.3
  • 17
    • 0242692452 scopus 로고    scopus 로고
    • A test for the Consecutive Ones Property on noisy data - Application to physical mapping and sequence assembly
    • Lu, W.-F., Hsu, W.-L.: A test for the Consecutive Ones Property on noisy data - application to physical mapping and sequence assembly. J. Comp. Biol. 10, 709-735 (2003)
    • (2003) J. Comp. Biol. , vol.10 , pp. 709-735
    • Lu, W.-F.1    Hsu, W.-L.2
  • 18
    • 33750386912 scopus 로고    scopus 로고
    • Reconstructing contiguous regions of an ancestral genome
    • Ma, J., et al.: Reconstructing contiguous regions of an ancestral genome. Genome Res. 16, 1557-1565 (2006)
    • (2006) Genome Res. , vol.16 , pp. 1557-1565
    • Ma, J.1
  • 19
    • 1842591771 scopus 로고    scopus 로고
    • A certifying algorithm for the consecutive-ones property
    • ACM, New York
    • McConnell, R.M.: A certifying algorithm for the consecutive-ones property. In: SODA 2004, pp. 761-770. ACM, New York (2004)
    • (2004) SODA 2004 , pp. 761-770
    • McConnell, R.M.1
  • 21
    • 67650170730 scopus 로고    scopus 로고
    • Prediction of contiguous ancestral regions in the amniote ancestral genome
    • Mǎndoiu, I., Narasimhan, G., Zhang, Y. (eds.). Springer, Heidelberg
    • Ouangraoua, A., Boyer, F., McPherson, A., Tannier, E., Chauve, C.: Prediction of contiguous ancestral regions in the amniote ancestral genome. In: Mǎndoiu, I., Narasimhan, G., Zhang, Y. (eds.) ISBRA 2009. LNCS (LNBI), vol. 5542. Springer, Heidelberg (2009)
    • (2009) ISBRA 2009. LNCS (LNBI) , vol.5542
    • Ouangraoua, A.1    Boyer, F.2    McPherson, A.3    Tannier, E.4    Chauve, C.5
  • 22
    • 0016523213 scopus 로고
    • Bounds on backtrack algorithms for listing cycles, paths, and spanning trees
    • Read, R.C., Tarjan, R.E.: Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks 5, 237-252 (1975)
    • (1975) Networks , vol.5 , pp. 237-252
    • Read, R.C.1    Tarjan, R.E.2
  • 23
  • 24
    • 0011610992 scopus 로고
    • A structure theorem for the consecutive 1's property
    • Tucker, A.C.: A structure theorem for the consecutive 1's property. J. Combinat. Theory (B) 12, 153-162 (1972)
    • (1972) J. Combinat. Theory (B) , vol.12 , pp. 153-162
    • Tucker, A.C.1
  • 25
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8, 410-421 (1979)
    • (1979) SIAM J. Comput. , vol.8 , pp. 410-421
    • Valiant, L.G.1


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