{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:08:03Z","timestamp":1742940483897,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662599570"},{"type":"electronic","value":"9783662599587"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-662-59958-7_3","type":"book-chapter","created":{"date-parts":[[2019,8,28]],"date-time":"2019-08-28T18:03:30Z","timestamp":1567015410000},"page":"44-63","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Study of Three Different Approaches to Point Placement on a Line in an Inexact Model"],"prefix":"10.1007","author":[{"given":"Kishore Kumar V.","family":"Kannan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pijus K.","family":"Sarker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amangeldy","family":"Turdaliev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Md. Zamilur","family":"Rahman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,29]]},"reference":[{"key":"3_CR1","unstructured":"Blumenthal, L.M.: Theory and Applications of Distance Geometry (1970)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-74126-8_35","volume-title":"Algorithms in Bioinformatics","author":"FYL Chin","year":"2007","unstructured":"Chin, F.Y.L., Leung, H.C.M., Sung, W.K., Yiu, S.M.: The point placement problem on a line \u2013 improved bounds for pairwise distance queries. In: Giancarlo, R., Hannenhalli, S. (eds.) WABI 2007. LNCS, vol. 4645, pp. 372\u2013382. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74126-8_35"},{"issue":"1","key":"3_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0166-218X(02)00284-6","volume":"127","author":"P Damaschke","year":"2003","unstructured":"Damaschke, P.: Point placement on the line by distance data. Discrete Appl. Math. 127(1), 53\u201362 (2003)","journal-title":"Discrete Appl. Math."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-1-4614-5128-0_16","volume-title":"Distance Geometry","author":"TE Malliavin","year":"2013","unstructured":"Malliavin, T.E., Mucherino, A., Nilges, M.: Distance geometry in structural biology: new perspectives. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry, pp. 329\u2013350. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-5128-0_16"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-319-21407-8_14","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2015","author":"A Mukhopadhyay","year":"2015","unstructured":"Mukhopadhyay, A., Sarker, P.K., Kannan, K.K.V.: Randomized versus deterministic point placement algorithms: an experimental study. In: Gervasi, O., et al. (eds.) ICCSA 2015. LNCS, vol. 9156, pp. 185\u2013196. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21407-8_14"},{"key":"3_CR6","volume-title":"Distance Geometry and Molecular Conformation","author":"GM Crippen","year":"1988","unstructured":"Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation, vol. 74. Research Studies Press, Somerset, England (1988)"},{"issue":"1","key":"3_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0166-218X(00)00189-X","volume":"104","author":"B Mumey","year":"2000","unstructured":"Mumey, B.: Probe location in the presence of errors: a problem from dna mapping. Discrete Appl. Math. 104(1), 187\u2013201 (2000)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1215","DOI":"10.1002\/jcc.10234","volume":"24","author":"DK Agrafiotis","year":"2003","unstructured":"Agrafiotis, D.K.: Stochastic proximity embedding. J. Comput. Chem. 24(10), 1215\u20131221 (2003)","journal-title":"J. Comput. Chem."},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Skiena, S.S., Smith, W.D., Lemke, P.: Reconstructing sets from interpoint distances (extended abstract). In: SCG 1990: Proceedings of the Sixth Annual Symposium on Computational Geometry, pp. 332\u2013339. ACM, New York (1990)","DOI":"10.1145\/98524.98598"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/0022-2836(70)90149-X","volume":"51","author":"H Smith","year":"1970","unstructured":"Smith, H., Wilcox, K.W.: A restriction enzyme from hemophilus influenzae. I. Purification and general properties. J. Mol. Biol. 51, 379\u2013391 (1970)","journal-title":"J. Mol. Biol."},{"key":"3_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-14974-5_4","volume-title":"Algorithms and Discrete Applied Mathematics","author":"MS Alam","year":"2015","unstructured":"Alam, M.S., Mukhopadhyay, A.: Three paths to point placement. In: Ganguly, S., Krishnamurti, R. (eds.) CALDAM 2015. LNCS, vol. 8959, pp. 33\u201344. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-14974-5_4"},{"issue":"1","key":"3_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF02287916","volume":"3","author":"G Young","year":"1938","unstructured":"Young, G., Householder, A.S.: Discussion of a set of points in terms of their mutual distances. Psychometrika 3(1), 19\u201322 (1938)","journal-title":"Psychometrika"},{"key":"3_CR13","unstructured":"Emiris, I.Z., Psarros, I.D.: Counting Euclidean embeddings of rigid graphs. CoRR abs\/1402.1484 (2014)"},{"key":"3_CR14","unstructured":"Saxe, J.B.: Embeddability of weighted graphs in $$k$$ -space is strongly NP-hard. In: 17th Allerton Conference on Communication, Control and Computing, pp. 480\u2013489 (1979)"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S1793830916500385","volume":"8","author":"A Mukhopadhyay","year":"2016","unstructured":"Mukhopadhyay, A., Rao, S.V., Pardeshi, S., Gundlapalli, S.: Linear layouts of weakly triangulated graphs. Discrete Math. Algorithms Appl. 8(3), 1\u201321 (2016)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"3_CR16","first-page":"1","volume":"6","author":"A Mukhopadhyay","year":"2016","unstructured":"Mukhopadhyay, A., Sarker, P.K., Kannan, K.K.: Point placement algorithms: an experimental study. Int. J. Exp. Algorithms 6(1), 1\u201313 (2016)","journal-title":"Int. J. Exp. Algorithms"},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Havel, T.F.: Distance geometry: Theory, algorithms, and chemical applications. In: Encyclopedia of Computational Chemistry, vol. 120 (1998)","DOI":"10.1002\/0470845015.cda018"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/geno.1995.0009","volume":"30","author":"WR Newell","year":"1995","unstructured":"Newell, W.R., Mott, R., Beck, S., Lehrach, H.: Construction of genetic maps using distance geometry. Genomics 30(1), 59\u201370 (1995)","journal-title":"Genomics"},{"issue":"1\u20133","key":"3_CR19","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0166-218X(88)90009-1","volume":"19","author":"AWM Dress","year":"1988","unstructured":"Dress, A.W.M., Havel, T.F.: Shortest-path problems and molecular conformation. Discrete Appl. Math. 19(1\u20133), 129\u2013144 (1988)","journal-title":"Discrete Appl. Math."},{"key":"3_CR20","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company, Cambridge, New York (1989)"},{"issue":"2","key":"3_CR21","first-page":"180","volume":"41","author":"KH Buetow","year":"1987","unstructured":"Buetow, K.H., Chakravarti, A.: Multipoint gene mapping using seriation. I. General methods. Am. J. Hum. Genet. 41(2), 180 (1987)","journal-title":"Am. J. Hum. Genet."},{"key":"3_CR22","unstructured":"Pinkerton, B.: Results of a simulated annealing algorithm for fish mapping. Communicated by Dr. Larry Ruzzo, University of Washington (1993)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-46521-9_3","volume-title":"Algorithms and Complexity","author":"J Redstone","year":"2000","unstructured":"Redstone, J., Ruzzo, W.L.: Algorithms for a simple point placement problem. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 32\u201343. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46521-9_3"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Science XXXIV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-59958-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,19]],"date-time":"2023-09-19T15:42:03Z","timestamp":1695138123000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-59958-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783662599570","9783662599587"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-59958-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}