{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:58:37Z","timestamp":1725893917508},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540778905"},{"type":"electronic","value":"9783540778912"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77891-2_21","type":"book-chapter","created":{"date-parts":[[2008,1,12]],"date-time":"2008-01-12T03:19:36Z","timestamp":1200107976000},"page":"222-233","source":"Crossref","is-referenced-by-count":2,"title":["Pairwise Compatibility Graphs"],"prefix":"10.1007","author":[{"given":"Muhammad Nur","family":"Yanhaona","sequence":"first","affiliation":[]},{"given":"K. S. M. Tozammel","family":"Hossain","sequence":"additional","affiliation":[]},{"given":"Md. Saidur","family":"Rahman","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_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. The MIT Press, Cambridge (2001)"},{"key":"21_CR2","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: Handbook of Combinatorial Optimization, vol.\u00a04. Kluwer Academic Publishers, Boston, MA (1999)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition, and consecutive ones testing. Theoretical Computer Science\u00a0234, 59\u201384 (2000)","journal-title":"Theoretical Computer Science"},{"key":"21_CR4","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":"21_CR5","series-title":"Lecture Notes in Bioinformatics","doi-asserted-by":"crossref","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, J.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":"21_CR6","doi-asserted-by":"crossref","unstructured":"Kearney, P., Corneil, D.G.: Tree powers. Journal of Algorithms, 111\u2013131 (1998)","DOI":"10.1006\/jagm.1998.9999"},{"key":"21_CR7","volume-title":"Introduction to Bioinformatics","author":"A.M. Lesk","year":"2002","unstructured":"Lesk, A.M.: Introduction to Bioinformatics. Oxford University Press, Oxford (2002)"},{"key":"21_CR8","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":"21_CR9","unstructured":"Phillips, D.: Uniform sampling from phylogenetic trees, Master\u2019s thesis, University of Waterloo (August 2002)"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Pardalos, M., Xue, J.: The maximum clique problem. Journal of Global Optimization, 301\u2013328 (1994)","DOI":"10.1007\/BF01098364"},{"key":"21_CR11","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2003","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall of India, New Delhi (2003)"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77891-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:55:08Z","timestamp":1619506508000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77891-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540778905","9783540778912"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77891-2_21","relation":{},"subject":[]}}