{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:46:20Z","timestamp":1742982380877,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9781071639887"},{"type":"electronic","value":"9781071639894"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-1-0716-3989-4_13","type":"book-chapter","created":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T08:02:38Z","timestamp":1715846558000},"page":"201-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Scalable Optimization Algorithm for\u00a0Solving the\u00a0Beltway and\u00a0Turnpike Problems with\u00a0Uncertain Measurements"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3818-3975","authenticated-orcid":false,"given":"C. S.","family":"Elder","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1053-6744","authenticated-orcid":false,"given":"Minh","family":"Hoang","sequence":"additional","affiliation":[]},{"given":"Mohsen","family":"Ferdosi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0118-5516","authenticated-orcid":false,"given":"Carl","family":"Kingsford","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,17]]},"reference":[{"issue":"19","key":"13_CR1","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1186\/s12859-016-1365-2","volume":"17","author":"MM Abbas","year":"2016","unstructured":"Abbas, M.M., Bahig, H.M.: A fast exact sequential algorithm for the partial digest problem. BMC Bioinform. 17(19), 510 (2016)","journal-title":"BMC Bioinform."},{"issue":"2","key":"13_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1089\/cmb.1995.2.159","volume":"2","author":"F Alizadeh","year":"1995","unstructured":"Alizadeh, F., Karp, R.M., Weisser, D.K., Zweig, G.: Physical mapping of chromosomes using unique probes. J. Comput. Biol. 2(2), 159\u2013184 (1995)","journal-title":"J. Comput. Biol."},{"key":"13_CR3","unstructured":"Birkhoff, G.: Three observations on linear algebra. Univ. Nac. Tacuman, Rev. Ser. A 5, 147\u2013151 (1946)"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1109\/TCBB.2007.1060","volume":"4","author":"J Blazewicz","year":"2007","unstructured":"Blazewicz, J., Burke, E., Kasprzak, M., Kovalev, A., Kovalyov, M.: Simplified partial digest problem: enumerative and dynamic programming algorithms. IEEE\/ACM Trans. Comput. Biol. Bioinf. 4, 668\u2013680 (2007)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Cieliebak, M., Eidenbenz, S.: Measurement errors make the partial digest problem NP-hard. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol. 2976, pp. 379\u2013390. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24698-5_42","DOI":"10.1007\/978-3-540-24698-5_42"},{"issue":"6","key":"13_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/MSP.2015.2398954","volume":"32","author":"I Dokmanic","year":"2015","unstructured":"Dokmanic, I., Parhizkar, R., Ranieri, J., Vetterli, M.: Euclidean Distance Matrices: essential theory, algorithms, and applications. IEEE Signal Process. Mag. 32(6), 12\u201330 (2015)","journal-title":"IEEE Signal Process. Mag."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Elder, C.S., Hoang, M., Ferdosi, M., Kingsford, C.: A scalable optimization algorithm for solving the beltway and turnpike problems with uncertain measurements. bioRxiv (2024)","DOI":"10.1101\/2024.02.15.580520"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"1540008","DOI":"10.1142\/S0219720015400089","volume":"13","author":"E Fomin","year":"2015","unstructured":"Fomin, E.: Reconstruction of sequence from its circular partial sums for cyclopeptide sequencing problem. J. Bioinform. Comput. Biol. 13(1), 1540008 (2015)","journal-title":"J. Bioinform. Comput. Biol."},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Fomin, E.: A simple approach to the reconstruction of a set of points from the multiset of pairwise distances in $$n^{2}$$ steps for the sequencing problem: III. Noise inputs for the beltway case. J. Comput. Biol. 26(1), 68\u201375 (2019)","DOI":"10.1089\/cmb.2018.0078"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Gabrys, R., Pattabiraman, S., Milenkovic, O.: Mass error-correction codes for polymer-based data storage. In: 2020 IEEE International Symposium on Information Theory (ISIT), pp. 25\u201330, June 2020. ISSN 2157-8117","DOI":"10.1109\/ISIT44484.2020.9174404"},{"key":"13_CR12","volume-title":"Inequalities","author":"GH Hardy","year":"1952","unstructured":"Hardy, G.H., Littlewood, J.E., P\u00f3lya, G.: Inequalities. Cambridge University Press, Cambridge (1952)"},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1109\/TSP.2021.3063458","volume":"69","author":"S Huang","year":"2021","unstructured":"Huang, S., Dokmani\u0107, I.: Reconstructing point sets from distance distributions. IEEE Trans. Signal Process. 69, 1811\u20131827 (2021)","journal-title":"IEEE Trans. Signal Process."},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Lemke, P., Skiena, S.S., Smith, W.D.: Reconstructing sets from interpoint distances. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry: The Goodman-Pollack Festschrift. Algorithms and Combinatorics, pp. 597\u2013631. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-642-55566-4_27","DOI":"10.1007\/978-3-642-55566-4_27"},{"issue":"4","key":"13_CR15","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"AK Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Math. Ann. 261(4), 515\u2013534 (1982)","journal-title":"Math. Ann."},{"key":"13_CR16","unstructured":"Mena, G.,\u00a0Snoek, J.,\u00a0Linderman, S.,\u00a0Belanger, D.: Learning latent permutations with Gumbel-Sinkhorn networks. In: International Conference on Learning Representation, vol. 2018 (2018)"},{"issue":"11","key":"13_CR17","doi-asserted-by":"publisher","first-page":"1371","DOI":"10.1089\/cmb.2011.0158","volume":"18","author":"H Mohimani","year":"2011","unstructured":"Mohimani, H., et al.: Multiplex de novo sequencing of peptide antibiotics. J. Comput. Biol. 18(11), 1371\u20131381 (2011)","journal-title":"J. Comput. Biol."},{"key":"13_CR18","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s13160-011-0041-1","volume":"28","author":"R Nadimi","year":"2011","unstructured":"Nadimi, R., Fathabadi, H.S., Ganjtabesh, M.: A fast algorithm for the partial digest problem. Jpn. J. Ind. Appl. Math. 28, 315\u2013325 (2011)","journal-title":"Jpn. J. Ind. Appl. Math."},{"issue":"3","key":"13_CR19","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1016\/S0022-0000(02)00008-9","volume":"65","author":"G Pandurangan","year":"2002","unstructured":"Pandurangan, G., Ramesh, H.: The restriction mapping problem revisited. J. Comput. Syst. Sci. 65(3), 526\u2013544 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR20","unstructured":"Skiena, S.S.,\u00a0Sundaram, G.: A partial digest approach to restriction site mapping. In: Proceedings. International Conference on Intelligent Systems for Molecular Biology, vol. 1, pp. 362\u2013370 (1993)"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Skiena, S.S., Smith, W.D., Lemke, P.: Reconstructing sets from interpoint distances (extended abstract). In: Proceedings of the Sixth Annual Symposium on Computational Geometry, SCG 1990, pp. 332\u2013339, New York, NY, USA, May 1990. Association for Computing Machinery (1990)","DOI":"10.1145\/98524.98598"},{"issue":"9","key":"13_CR22","doi-asserted-by":"publisher","first-page":"2387","DOI":"10.1093\/nar\/3.9.2387","volume":"3","author":"HO Smith","year":"1976","unstructured":"Smith, H.O., Birnstiel, M.L.: A simple method for DNA restriction site mapping. Nucleic Acids Res. 3(9), 2387\u20132398 (1976)","journal-title":"Nucleic Acids Res."},{"issue":"3","key":"13_CR23","doi-asserted-by":"publisher","first-page":"794","DOI":"10.1109\/TSP.2016.2601299","volume":"65","author":"Y Sun","year":"2017","unstructured":"Sun, Y., Babu, P., Palomar, D.P.: Majorization-minimization algorithms in signal processing, communications, and machine learning. IEEE Trans. Signal Process. 65(3), 794\u2013816 (2017)","journal-title":"IEEE Trans. Signal Process."},{"key":"13_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/9781316544938","volume-title":"Numerical Linear Algebra: An Introduction","author":"H Wendland","year":"2017","unstructured":"Wendland, H.: Numerical Linear Algebra: An Introduction. Cambridge University Press, Cambridge (2017)"},{"issue":"3","key":"13_CR25","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1089\/cmb.1994.1.235","volume":"1","author":"Z Zhang","year":"1994","unstructured":"Zhang, Z.: An exponential example for a partial digest mapping algorithm. J. Comput. Biol. 1(3), 235\u2013239 (1994)","journal-title":"J. Comput. Biol."},{"issue":"6","key":"13_CR26","doi-asserted-by":"publisher","first-page":"62306","DOI":"10.1103\/PhysRevA.93.062306","volume":"93","author":"I Zintchenko","year":"2016","unstructured":"Zintchenko, I., Wiebe, N.: Randomized gap and amplitude estimation. Phys. Rev. A 93(6), 62306 (2016)","journal-title":"Phys. Rev. A"}],"container-title":["Lecture Notes in Computer Science","Research in Computational Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-0716-3989-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,16]],"date-time":"2024-05-16T08:03:58Z","timestamp":1715846638000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-0716-3989-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9781071639887","9781071639894"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-1-0716-3989-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RECOMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Research in Computational Molecular Biology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge, MA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"recomb2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/recomb.org\/recomb2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}