{"url":"https://leeswijzer.hatenadiary.com/entry/20180727/1533795460","published":"2018-07-27 15:17:40","blog_title":"leeswijzer: een nieuwe leeszaal van dagboek","author_name":"leeswijzer","width":"100%","provider_url":"https://hatena.blog","type":"rich","categories":["\u76ee"],"provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/leeswijzer/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fleeswijzer.hatenadiary.com%2Fentry%2F20180727%2F1533795460\" title=\"\u300eReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks\u300f - leeswijzer: een nieuwe leeszaal van dagboek\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","height":"190","title":"\u300eReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks\u300f","description":"Dan Gusfield \uff082014\u5e747\u6708\u520a\u884c, The MIT Press, Massachusetts, xx+580 pp., ISBN:9780262027526 [hbk] \u2192 \u7248\u5143\u30da\u30fc\u30b8\uff09 \u3010\u76ee\u6b21\u3011 Preface xi Acknowledgments xix 1. Introduction 1 2. Trees First 35 3. A Deeper Introduction to Recombination and Networks 61 4. Exploiting Recombination 97 5. First Bounds 127 6. Fundamental Com\u2026","version":"1.0","image_url":null,"blog_url":"https://leeswijzer.hatenadiary.com/"}