{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:04:41Z","timestamp":1725728681571},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642390524"},{"type":"electronic","value":"9783642390531"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39053-1_40","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T04:28:12Z","timestamp":1370233692000},"page":"340-341","source":"Crossref","is-referenced-by-count":0,"title":["Using Random Graphs in Population Genomics"],"prefix":"10.1007","author":[{"given":"Laxmi","family":"Parida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"crossref","unstructured":"Utro, F., Pybus, M., Parida, L.: Sum of parts is greater than the whole: inference of common genetic history of populations. BMC Genomics (2013)","DOI":"10.1186\/1471-2164-14-S1-S10"},{"key":"40_CR2","doi-asserted-by":"crossref","unstructured":"Utro, F., Cornejo, O.E., Livingstone, D., Motamayor, J.C., Parida, L.: ARG-based Genome-wide Analysis of Cacao Cultivars. BMC Bioinformatics (2012)","DOI":"10.1186\/1471-2105-13-S19-S17"},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"Javed, A., Pybus, M., Mele, M., Utro, F., Bertranpetit, J., Calafell, F., Parida, L.: IRiS: Construction of ARG networks at genomic scales. Bioinformatics (2011)","DOI":"10.1093\/bioinformatics\/btr423"},{"key":"40_CR4","doi-asserted-by":"crossref","unstructured":"Javed, A., Mele, M., Pybus, M., Zalloua, P., Haber, M., Comas, D., Netea, M., Balanovsky, O., Balanovska, E., Jin, L., Yang, Y., Arunkumar, G., Pitchappan, R.M., Bertranpetit, J., Calafell, F., Parida, L.: The Genographic Consortium: Recombination networks as genetic markers: a human variation study of the Old World. Human Genetics (2011)","DOI":"10.1007\/s00439-011-1104-8"},{"key":"40_CR5","doi-asserted-by":"crossref","unstructured":"Mele, M., Javed, A., Pybus, M., Zalloua, P., Haber, M., Comas, D., Netea, M., Balanovsky, O., Balanovska, E., Jin, L., Yang, Y., Pitchappan, R.M., Arunkumar, G., Parida, L., Calafell, F., Bertranpetit, J.: The Genographic Consortium: The footprint of recombination gives a new insight in the effective population size and the history of the Old World human populations. Molecular Biology and Evolution (2011)","DOI":"10.1093\/molbev\/msr213"},{"key":"40_CR6","doi-asserted-by":"crossref","unstructured":"Parida, L., Palamara, P.F., Javed, A.: A Minimal Descriptor of an Ancestral Recombinations Graph. BMC Bioinformatics\u00a012(Suppl. 1) (2011)","DOI":"10.1186\/1471-2105-12-S1-S6"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"Mele, M., Javed, A., Calafell, P.F., Parida, L., Bertranpetit, J.: A New Method to Reconstruct Recombination Events at a Genomic Scale. PLoS Computational Biology (2010)","DOI":"10.1371\/journal.pcbi.1001010"},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"Parida, L.: Ancestral Recombinations Graph: A Reconstructability Perspective using Random-Graphs Framework. Journal of Computational Biology (2010)","DOI":"10.1089\/cmb.2009.0243"},{"key":"40_CR9","doi-asserted-by":"crossref","unstructured":"Parida, L., Javed, A., Mele, M., Calafell, P.F., Bertranpetit, J.: Minimizing Recombinations in Consensus Networks for Phylogeographic Studies. BMC Bioinformatics (2009)","DOI":"10.1186\/1471-2105-10-S1-S72"},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"Parida, L., Mele, M., Calafell, P.F., Bertranpetit, J.: The Genographic Consortium: Estimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns. Journal of Computational Biology (2008)","DOI":"10.1089\/cmb.2008.0065"}],"container-title":["Lecture Notes in Computer Science","The Nature of Computation. Logic, Algorithms, Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39053-1_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T15:14:41Z","timestamp":1595862881000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39053-1_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642390524","9783642390531"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39053-1_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}