메뉴 건너뛰기




Volumn 83, Issue 1, 2013, Pages 55-63

A simple greedy algorithm for reconstructing pedigrees

Author keywords

Greedy search; Maximum likelihood pedigree; Pedigree reconstruction

Indexed keywords

MICROSATELLITE DNA;

EID: 84873464244     PISSN: 00405809     EISSN: 10960325     Source Type: Journal    
DOI: 10.1016/j.tpb.2012.11.002     Document Type: Article
Times cited : (12)

References (24)
  • 2
    • 0038620466 scopus 로고    scopus 로고
    • A simulated annealing algorithm for maximum likelihood pedigree reconstruction
    • Almudevar A. A simulated annealing algorithm for maximum likelihood pedigree reconstruction. Theoretical Population Biology 2003, 63:63-75.
    • (2003) Theoretical Population Biology , vol.63 , pp. 63-75
    • Almudevar, A.1
  • 3
    • 84856540684 scopus 로고    scopus 로고
    • On the choice of prior density for the Bayesian analysis of pedigree structure
    • Almudevar A., LaCombe J. On the choice of prior density for the Bayesian analysis of pedigree structure. Theoretical Population Biology 2012, 81:131-143.
    • (2012) Theoretical Population Biology , vol.81 , pp. 131-143
    • Almudevar, A.1    LaCombe, J.2
  • 4
    • 0141790880 scopus 로고    scopus 로고
    • DNA-based methods for pedigree reconstruction and kinship analysis in natural populations
    • Blouin M.S. DNA-based methods for pedigree reconstruction and kinship analysis in natural populations. TRENDS in Ecology and Evolution 2003, 18(10):503-511.
    • (2003) TRENDS in Ecology and Evolution , vol.18 , Issue.10 , pp. 503-511
    • Blouin, M.S.1
  • 5
    • 70449102681 scopus 로고    scopus 로고
    • Efficient maximum likelihood pedigree reconstruction
    • Cowell R.G. Efficient maximum likelihood pedigree reconstruction. Theoretical Population Biology 2009, 76:285-291.
    • (2009) Theoretical Population Biology , vol.76 , pp. 285-291
    • Cowell, R.G.1
  • 6
    • 84873447637 scopus 로고    scopus 로고
    • Maximum likelihood pedigree reconstruction using integer programming. in: Proceedings of the Workshop on Constraint Based Methods for Bioinformatics (WCB-10) Edinburgh.
    • Cussens, J., 2010. Maximum likelihood pedigree reconstruction using integer programming. in: Proceedings of the Workshop on Constraint Based Methods for Bioinformatics (WCB-10) Edinburgh.
    • (2010)
    • Cussens, J.1
  • 7
    • 84871063192 scopus 로고    scopus 로고
    • Maximum likelihood pedigree reconstruction using integer linear programming. Genetic Epidemiology
    • Cussens, J., Bartlett, M., Jones, E.M., Sheehan, N.A., 2012. Maximum likelihood pedigree reconstruction using integer linear programming. Genetic Epidemiology, in press (). http://dx.doi.org/10.1002/gepi.21686.
    • (2012)
    • Cussens, J.1    Bartlett, M.2    Jones, E.M.3    Sheehan, N.A.4
  • 8
    • 0034621283 scopus 로고    scopus 로고
    • Beyond traditional paternity and identification cases: Selecting the most probable pedigree
    • Egeland T., Mostad P.F., Mevåg B., Stenersen M. Beyond traditional paternity and identification cases: Selecting the most probable pedigree. Forensic Science International 2000, 110:47-59.
    • (2000) Forensic Science International , vol.110 , pp. 47-59
    • Egeland, T.1    Mostad, P.F.2    Mevåg, B.3    Stenersen, M.4
  • 10
    • 33749824427 scopus 로고    scopus 로고
    • Towards unbiased parentage assignment: combining genetic, behavioural and spatial data in a Bayesian framework
    • Hadfield J.D., Richardson D.S., Burke T. Towards unbiased parentage assignment: combining genetic, behavioural and spatial data in a Bayesian framework. Molecular Ecology 2006, 15(12):3715-3730. URL http://dx.doi.org/10.1111/j.1365-294X.2006.03050.x.
    • (2006) Molecular Ecology , vol.15 , Issue.12 , pp. 3715-3730
    • Hadfield, J.D.1    Richardson, D.S.2    Burke, T.3
  • 11
    • 33646865961 scopus 로고    scopus 로고
    • Development of a microsatellite DNA parentage marker suite for black tiger shrimp penaeus monodon
    • Jerry D.R., Evansa B.S., Kenway M., Wilson K. Development of a microsatellite DNA parentage marker suite for black tiger shrimp penaeus monodon. Aquaculture 2005, 255:1-4.
    • (2005) Aquaculture , vol.255 , pp. 1-4
    • Jerry, D.R.1    Evansa, B.S.2    Kenway, M.3    Wilson, K.4
  • 12
    • 0141724877 scopus 로고    scopus 로고
    • Methods of parentage analysis in natural populations
    • Jones A.G., Ardren W.R. Methods of parentage analysis in natural populations. Molecular Ecology 2003, 12:2511-2523.
    • (2003) Molecular Ecology , vol.12 , pp. 2511-2523
    • Jones, A.G.1    Ardren, W.R.2
  • 13
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • Kruskal J.B. On the shortest spanning subtree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society 1956, 7(1):48-50.
    • (1956) Proceedings of the American Mathematical Society , vol.7 , Issue.1 , pp. 48-50
    • Kruskal, J.B.1
  • 14
    • 0000685484 scopus 로고
    • A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path
    • Lawler E. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path. Management Science 1972, 7:401-405.
    • (1972) Management Science , vol.7 , pp. 401-405
    • Lawler, E.1
  • 15
    • 0000849368 scopus 로고
    • An algorithm for ranking all the assignments in order of increasing cost
    • Murty K.G. An algorithm for ranking all the assignments in order of increasing cost. Operations Research 1968, 16(3):682-687.
    • (1968) Operations Research , vol.16 , Issue.3 , pp. 682-687
    • Murty, K.G.1
  • 16
    • 0006776658 scopus 로고    scopus 로고
    • An efficient algorithm for finding the M most probable configurations in a probabilistic expert system
    • Nilsson D. An efficient algorithm for finding the M most probable configurations in a probabilistic expert system. Statistics and Computing 1998, 8:159-173.
    • (1998) Statistics and Computing , vol.8 , pp. 159-173
    • Nilsson, D.1
  • 18
    • 68549101953 scopus 로고    scopus 로고
    • FRANz: fast reconstruction of wild pedigrees
    • Riester M., Stadler P.F., Klemm K. FRANz: fast reconstruction of wild pedigrees. Bioinformatics 2009, 25:2134-2139.
    • (2009) Bioinformatics , vol.25 , pp. 2134-2139
    • Riester, M.1    Stadler, P.F.2    Klemm, K.3
  • 19
    • 34249899967 scopus 로고    scopus 로고
    • Structured incorporation of prior information in relationship identification problems
    • Sheehan N.A., Egeland T. Structured incorporation of prior information in relationship identification problems. Annals of Human Genetics 2007, 71(Pt 4):501-518. URL http://dx.doi.org/10.1111/j.1469-1809.2006.00345.x.
    • (2007) Annals of Human Genetics , vol.71 , Issue.PART 4 , pp. 501-518
    • Sheehan, N.A.1    Egeland, T.2
  • 20
    • 80053201441 scopus 로고    scopus 로고
    • A simple approach to finding the globally optimal Bayesian network structure
    • AUAI Press, R. Dechter, T. Richardson (Eds.)
    • Silander T., Myllymäkki P. A simple approach to finding the globally optimal Bayesian network structure. Proceedings of the 22nd Conference on Artificial intelligence 2006, 445-452. AUAI Press. R. Dechter, T. Richardson (Eds.).
    • (2006) Proceedings of the 22nd Conference on Artificial intelligence , pp. 445-452
    • Silander, T.1    Myllymäkki, P.2
  • 21
    • 38149028345 scopus 로고    scopus 로고
    • An algorithm to generate all spanning trees of a graph in order of increasing cost
    • Sörensen K., Janssens G.K. An algorithm to generate all spanning trees of a graph in order of increasing cost. Pesquisa Operacional 2005, 25(2):219-229.
    • (2005) Pesquisa Operacional , vol.25 , Issue.2 , pp. 219-229
    • Sörensen, K.1    Janssens, G.K.2


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