메뉴 건너뛰기




Volumn 348, Issue 2-3 SPEC. ISS., 2005, Pages 240-250

The minimum-entropy set cover problem

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; ENTROPY; MATHEMATICAL MODELS; SET THEORY;

EID: 33644555811     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.015     Document Type: Conference Paper
Times cited : (30)

References (20)
  • 1
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • V. Chvátal A greedy heuristic for the set-covering problem Math. Oper. Res. 4 1979 233 235
    • (1979) Math. Oper. Res. , vol.4 , pp. 233-235
    • Chvátal, V.1
  • 3
    • 4444366037 scopus 로고    scopus 로고
    • Efficient reconstruction of haplotype structure via perfect phylogeny
    • E. Eskin, E. Halperin, and R. Karp Efficient reconstruction of haplotype structure via perfect phylogeny J. Bioinformatics Comput. Biol. 1 1 2003 1 20
    • (2003) J. Bioinformatics Comput. Biol. , vol.1 , Issue.1 , pp. 1-20
    • Eskin, E.1    Halperin, E.2    Karp, R.3
  • 4
    • 0032108328 scopus 로고    scopus 로고
    • A threshold of ln n for approximating set cover
    • U. Feige A threshold of ln n for approximating set cover J. ACM 45 1998
    • (1998) J. ACM , vol.45
    • Feige, U.1
  • 12
    • 2442423646 scopus 로고    scopus 로고
    • In silico haplotype determination of a vast set of single nucleotide polymorphisms
    • Department of Statistics, Harvard University
    • Niu, Qin, Xu, Liu, In silico haplotype determination of a vast set of single nucleotide polymorphisms, Technical report, Department of Statistics, Harvard University, 2001.
    • (2001) Technical Report
    • Niu1    Qin2    Xu3    Liu4
  • 13
    • 0001326115 scopus 로고
    • The hardness of approximation: Gap location
    • E. Petrank The hardness of approximation: gap location Comput. Complexity 4 1994 133 157
    • (1994) Comput. Complexity , vol.4 , pp. 133-157
    • Petrank, E.1
  • 17
    • 0035422134 scopus 로고    scopus 로고
    • Minimum-entropy data partitioning using reversible jump markov chain Monte carlo
    • S.J. Roberts, C. Holmes, and D. Denison Minimum-entropy data partitioning using reversible jump markov chain Monte carlo IEEE Trans. Pattern Anal. Mach. Intell. 23 8 2001 909 914
    • (2001) IEEE Trans. Pattern Anal. Mach. Intell. , vol.23 , Issue.8 , pp. 909-914
    • Roberts, S.J.1    Holmes, C.2    Denison, D.3
  • 18
    • 33644550436 scopus 로고    scopus 로고
    • Personal communication
    • R. Sharan, Personal communication, 2003.
    • (2003)
    • Sharan, R.1
  • 19
    • 0035071957 scopus 로고    scopus 로고
    • A new statistical method for haplotype reconstruction from population data
    • M. Stephens, N. Smith, and P. Donnelly A new statistical method for haplotype reconstruction from population data Amer. J. Human Genetics 68 2001 978 989
    • (2001) Amer. J. Human Genetics , vol.68 , pp. 978-989
    • Stephens, M.1    Smith, N.2    Donnelly, P.3
  • 20
    • 0030783296 scopus 로고    scopus 로고
    • A "microscopic" study of minimum entropy search in learning decomposable markov networks
    • Y. Xiang, S.K.M. Wong, and N. Cercone A "microscopic" study of minimum entropy search in learning decomposable markov networks Mach. Learn. 26 1 1997 65 92
    • (1997) Mach. Learn. , vol.26 , Issue.1 , pp. 65-92
    • Xiang, Y.1    Wong, S.K.M.2    Cercone, N.3


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