{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T23:33:12Z","timestamp":1743031992826,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031379390"},{"type":"electronic","value":"9783031379406"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-37940-6_11","type":"book-chapter","created":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T20:23:00Z","timestamp":1690057380000},"page":"122-135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Perfect Phylogeny Using ILP and\u00a0Continuous Approximations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3514-6344","authenticated-orcid":false,"given":"B. E.","family":"Pranav Kumaar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7310-1166","authenticated-orcid":false,"given":"A.","family":"Aadharsh Aadhithya","sequence":"additional","affiliation":[]},{"given":"S.","family":"Sachin Kumar","sequence":"additional","affiliation":[]},{"given":"Harishchander","family":"Anandaram","sequence":"additional","affiliation":[]},{"given":"K. P.","family":"Soman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,23]]},"reference":[{"key":"11_CR1","doi-asserted-by":"publisher","unstructured":"Kanz, C., et al.: The EMBL nucleotide sequence database. Nucleic Acids Res. 33, D29\u2013D33 (2005). ISSN 0305-1048. https:\/\/doi.org\/10.1093\/nar\/gki098, https:\/\/www.ncbi.nlm.nih.gov\/pmc\/articles\/PMC540052\/. Accessed 01 Dec 2022","DOI":"10.1093\/nar\/gki098"},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"Clark, K., et al.: GenBank. Nucleic Acids Res. 44, pp. D67\u2013D72 (2016). ISSN 0305-1048. https:\/\/doi.org\/10.1093\/nar\/gkv1276, https:\/\/www.ncbi.nlm.nih.gov\/pmc\/articles\/PMC4702903\/. Accessed 01 Dec 2022","DOI":"10.1093\/nar\/gkv1276"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"NCBI Geo: archive for functional genomics data sets\u2014update\u2014Nucleic Acids Research\u2014Oxford Academic. https:\/\/academic.oup.com\/nar\/article\/41\/D1\/D991\/1067995. Accessed 01 Dec 2022","DOI":"10.1093\/nar\/gks1193"},{"key":"11_CR4","unstructured":"miRBase: microRNA sequences, targets and gene nomenclature. https:\/\/www.ncbi.nlm.nih.gov\/pmc\/articles\/PMC1347474\/. Accessed 01 Dec 2022"},{"key":"11_CR5","doi-asserted-by":"publisher","unstructured":"Zou, D., et al.: Biological databases for human research. Genom. Proteomics Bioinform. 13(1), 55\u201363 (2015). ISSN 1672-0229. https:\/\/doi.org\/10.1016\/j.gpb.2015.01.006, https:\/\/www.ncbi.nlm.nih.gov\/pmc\/articles\/PMC4411498\/. Accessed 01 Nov 2022","DOI":"10.1016\/j.gpb.2015.01.006"},{"issue":"6","key":"11_CR6","doi-asserted-by":"publisher","first-page":"1336","DOI":"10.1109\/TKDE.2012.51","volume":"25","author":"Y-X Wang","year":"2013","unstructured":"Wang, Y.-X., Zhang, Y.-J.: Nonnegative matrix factorization: a comprehensive review. IEEE Trans. Knowl. Data Eng. 25(6), 1336\u20131353 (2013). https:\/\/doi.org\/10.1109\/TKDE.2012.51","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2012.12.048","volume":"476","author":"M Habib","year":"2013","unstructured":"Habib, M., Stacho, J.: Unique perfect phylogeny is intractable. Theoret. Comput. Sci. 476, 47\u201366 (2013)","journal-title":"Theoret. Comput. Sci."},{"key":"11_CR8","doi-asserted-by":"publisher","unstructured":"Gusfield, D.: Integer Linear Programming in Computational and Systems Biology: An Entry-Level Text and Course. Cambridge University Press, Cambridge (2019). https:\/\/doi.org\/10.1017\/9781108377737","DOI":"10.1017\/9781108377737"},{"key":"11_CR9","unstructured":"Anbuudayasankar, S., Mohandas, K.: Mixed-integer linear programming for vehicle routing problem with simultaneous delivery and PickUp with maximum route-length. Undefined (2008)"},{"key":"11_CR10","doi-asserted-by":"publisher","unstructured":"Kesav, R.S., Premjith, B., Soman, K.P.: Dependency parser for Hindi using integer linear programming. In: Singh, M., Tyagi, V., Gupta, P.K., Flusser, J., \u00d6ren, T., Sonawane, V.R. (eds.) ICACDS 2021. CCIS, vol. 1441, pp. 42\u201351. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-88244-0_5. ISBN 978-3-030-88243-3","DOI":"10.1007\/978-3-030-88244-0_5"},{"key":"11_CR11","doi-asserted-by":"publisher","unstructured":"Nayak, S.: Chapter eight - integer programming. In: Nayak, S. (ed.) Fundamentals of Optimization Techniques with Algorithms, pp. 223\u2013252. Academic Press (2020). ISBN 978-0-12-821126-7. https:\/\/doi.org\/10.1016\/B978-0-12-821126-7.00008-5, https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780128211267000085. Accessed 08 June 2022","DOI":"10.1016\/B978-0-12-821126-7.00008-5"},{"key":"11_CR12","doi-asserted-by":"publisher","unstructured":"Aparnna, T., Raji, P.G., Soman, K.P.: Integer linear programming approach to dependency parsing for MALAYALAM. In: 2010 International Conference on Recent Trends in Information, Telecommunication and Computing, pp. 324\u2013326 (2010). https:\/\/doi.org\/10.1109\/ITC.2010.97","DOI":"10.1109\/ITC.2010.97"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"IM Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization, pp. 1\u201374. Springer, Boston (1999). https:\/\/doi.org\/10.1007\/978-1-4757-3023-4_1"},{"key":"11_CR14","unstructured":"Belachew, M.T.: NMF-based algorithms for data mining and analysis: feature extraction, clustering, and maximum clique finding. Ph.D thesis (2014)"}],"container-title":["Communications in Computer and Information Science","Advances in Computing and Data Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37940-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,22]],"date-time":"2023-07-22T20:23:42Z","timestamp":1690057422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37940-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031379390","9783031379406"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37940-6_11","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICACDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advances in Computing and Data Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icacds2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.icacds.com\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair & Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"464","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}