{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,15]],"date-time":"2025-05-15T14:03:14Z","timestamp":1747317794391},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642140303"},{"type":"electronic","value":"9783642140310"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14031-0_43","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T09:50:06Z","timestamp":1277718606000},"page":"399-408","source":"Crossref","is-referenced-by-count":2,"title":["Discovering Pairwise Compatibility Graphs"],"prefix":"10.1007","author":[{"given":"Muhammad Nur","family":"Yanhaona","sequence":"first","affiliation":[]},{"given":"Md. Shamsuzzoha","family":"Bayzid","sequence":"additional","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"43_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"43_CR2","volume-title":"An Introduction to Bioinformatics Algorithms","author":"N.C. Jones","year":"2004","unstructured":"Jones, N.C., Pevzner, P.A.: An Introduction to Bioinformatics Algorithms. The MIT Press, Cambridge (2004)"},{"key":"43_CR3","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-540-39763-2_14","volume-title":"Algorithms in Bioinformatics","author":"P. Kearney","year":"2003","unstructured":"Kearney, P., Munro, I., Phillips, D.: Efficient Generation of Uniform Samples from Phylogenetic Trees. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol.\u00a02812, pp. 177\u2013189. Springer, Heidelberg (2003)"},{"key":"43_CR4","volume-title":"Introduction to Bioinformatics","author":"A.M. Lesk","year":"2002","unstructured":"Lesk, A.M.: Introduction to Bioinformatics. Oxford University Press, Oxford (2002)"},{"key":"43_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/3-540-40996-3_46","volume-title":"Algorithms and Computation","author":"G.H. Lin","year":"2000","unstructured":"Lin, G.H., Jiang, T., Kearney, P.E.: Phylogenetic k-root and steiner k-root. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol.\u00a01969, pp. 539\u2013551. Springer, Heidelberg (2000)"},{"key":"43_CR6","unstructured":"Phillips, D.: Uniform Sampling From Phylogenetics Trees. Master\u2019s thesis, University of Waterloo (August 2002)"},{"key":"43_CR7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s12190-008-0204-7","volume":"30","author":"M.N. Yanhaona","year":"2009","unstructured":"Yanhaona, M.N., Hossain, K.S.M.T., Rahman, M.S.: Pairwise compatibility graphs. Journal of Applied Mathematics and Computing\u00a030, 479\u2013503 (2009)","journal-title":"Journal of Applied Mathematics and Computing"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14031-0_43.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:16:33Z","timestamp":1619784993000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14031-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642140303","9783642140310"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14031-0_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}