{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T17:53:23Z","timestamp":1765389203998,"version":"3.46.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,10,12]]},"DOI":"10.1145\/3765612.3767208","type":"proceedings-article","created":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T17:45:59Z","timestamp":1765388759000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient and effective methods for variant selection"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4279-469X","authenticated-orcid":false,"given":"Srinivas","family":"Aluru","sequence":"first","affiliation":[{"name":"Georgia Tech Research Corporation, Atlanta, GA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2910-3540","authenticated-orcid":false,"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[{"name":"\u00c9cole normale sup\u00e9rieure de Lyon, Lyon, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4960-3545","authenticated-orcid":false,"given":"Bora","family":"U\u00e7ar","sequence":"additional","affiliation":[{"name":"LIP (CNRS, Inria, ENS de Lyon, UCBL1), CNRS, Lyon, France"}]}],"member":"320","published-online":{"date-parts":[[2025,12,10]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Orlin","author":"Ahuja Ravindra K.","year":"1993","unstructured":"Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin. 1993. Network flows: theory, algorithms, and applications. Prentice-Hall, Inc., USA."},{"key":"e_1_3_2_1_2_1","volume-title":"Van Bang Le, and Jeremy P. Spinrad","author":"Brandst\u00e4dt Andreas","year":"1999","unstructured":"Andreas Brandst\u00e4dt, Van Bang Le, and Jeremy P. Spinrad. 1999. Graph Classes: A Survey. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3610940"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316303"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btr330"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0109384"},{"key":"e_1_3_2_1_7_1","volume-title":"Improved genome inference in the MHC using a population reference graph. Nature genetics 47, 6","author":"Dilthey Alexander","year":"2015","unstructured":"Alexander Dilthey, Charles Cox, Zamin Iqbal, Matthew R Nelson, and Gil McVean. 2015. Improved genome inference in the MHC using a population reference graph. Nature genetics 47, 6 (2015), 682\u2013688."},{"key":"e_1_3_2_1_8_1","first-page":"27","article-title":"Algorithimic Aspects of the Consecutive-Ones","volume":"98","author":"Dom Michael","year":"2009","unstructured":"Michael Dom. 2009. Algorithimic Aspects of the Consecutive-Ones Property. Bull. EATCS 98 (2009), 27\u201359.","journal-title":"Property. Bull. EATCS"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Hannes P. Eggertsson Hakon Jonsson Snaedis Kristmundsdottir Eirikur Hjartarson Birte Kehr Gisli Masson Florian Zink Kristjan E. Hjorleifsson Aslaug Jonasdottir Adalbjorg Jonasdottir et al. 2017. Graphtyper enables population-scale genotyping using pangenome graphs. Nature genetics 49 11 (2017) 1654.","DOI":"10.1038\/ng.3964"},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of the 5th British Combinatorial Conference, Nash-Williams, C. St. J. A. and Sheen, J. (Eds.). Utilitas Mathematica, 211\u2013226","author":"Frank Andr\u00e1s","year":"1975","unstructured":"Andr\u00e1s Frank. 1975. Some polynomial algorithms for certain graphs and hypergraphs. In Proceedings of the 5th British Combinatorial Conference, Nash-Williams, C. St. J. A. and Sheen, J. (Eds.). Utilitas Mathematica, 211\u2013226."},{"key":"e_1_3_2_1_11_1","volume-title":"Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics","author":"Golumbic Martin Charles","unstructured":"Martin Charles Golumbic. 2004. Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, Vol. 57. North-Holland Publishing Co., Amsterdam, The Netherlands, The Netherlands."},{"key":"e_1_3_2_1_12_1","unstructured":"Ernestine Gro\u00dfmann Kenneth Langedal and Christian Schulz. 2024. A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem. arXiv:2412.09303 [cs.DS] https:\/\/arxiv.org\/abs\/2412.09303"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195221"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btab302"},{"key":"e_1_3_2_1_15_1","volume-title":"VF: Variant selection framework in genome graphs (v1.0). https:\/\/github.com\/at-cg\/VF","author":"Jain Chirag","year":"2021","unstructured":"Chirag Jain, Neda Tavakoli, and Srinivas Aluru. 2021. VF: Variant selection framework in genome graphs (v1.0). https:\/\/github.com\/at-cg\/VF"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.10.021"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13059-018-1595-x"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(02)00205-6"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0504-0"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0213035"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2024.0601"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature15393"}],"event":{"name":"BCB '25: 16th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics","location":"Element Philadelphia Downtown Philadelphia PA USA","acronym":"BCB '25","sponsor":["SIGBio ACM Special Interest Group on Bioinformatics"]},"container-title":["Proceedings of the 16th ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3765612.3767208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T17:49:06Z","timestamp":1765388946000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3765612.3767208"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,12]]},"references-count":22,"alternative-id":["10.1145\/3765612.3767208","10.1145\/3765612"],"URL":"https:\/\/doi.org\/10.1145\/3765612.3767208","relation":{},"subject":[],"published":{"date-parts":[[2025,10,12]]},"assertion":[{"value":"2025-12-10","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}