{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:44:03Z","timestamp":1725860643652},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319420844"},{"type":"electronic","value":"9783319420851"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42085-1_7","type":"book-chapter","created":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T02:50:27Z","timestamp":1467341427000},"page":"84-96","source":"Crossref","is-referenced-by-count":0,"title":["Point Placement in an Inexact Model with Applications"],"prefix":"10.1007","author":[{"given":"Kishore Kumar V.","family":"Kannan","sequence":"first","affiliation":[]},{"given":"Pijus K.","family":"Sarker","sequence":"additional","affiliation":[]},{"given":"Amangeldy","family":"Turdaliev","sequence":"additional","affiliation":[]},{"given":"Asish","family":"Mukhopadhyay","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"7_CR1","volume-title":"Theory and Applications of Distance Geometry","author":"LM Blumenthal","year":"1970","unstructured":"Blumenthal, L.M.: Theory and Applications of Distance Geometry. Chelsea, New York (1970)"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"crossref","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 (LNBI), vol. 4645, pp. 372\u2013382. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR3","doi-asserted-by":"crossref","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."},{"issue":"3","key":"7_CR4","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1(3), 211\u2013218 (1936)","journal-title":"Psychometrika"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Malliavin, T.E., Mucherino, A., Nilges, M.: Distance geometry in structural biology: new perspectives. In: Distance Geometry, pp. 329\u2013350. Springer, New York (2013)","DOI":"10.1007\/978-1-4614-5128-0_16"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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., Murgante, B., Misra, S., Gavrilova, M.L., Rocha, A.M.A.C., Torre, C., Taniar, D., Apduhan, B.O. (eds.) ICCSA 2015. LNCS, vol. 9156, pp. 185\u2013196. Springer, Heidelberg (2015)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/978-3-319-19048-8_24","volume-title":"Bioinformatics Research and Applications","author":"K Roy","year":"2015","unstructured":"Roy, K., Panigrahi, S.C., Mukhopadhyay, A.: Multiple alignment of structures using center of proteins. In: Harrison, R., Li, Y., M\u0103ndoiu, I. (eds.) ISBRA 2015. LNCS, vol. 9096, pp. 284\u2013296. Springer, Heidelberg (2015)"},{"key":"7_CR8","first-page":"723","volume":"120","author":"TF Havel","year":"1998","unstructured":"Havel, T.F.: Distance geometry: theory, algorithms, and chemical applications. Encycl. Comput. Chem. 120, 723\u2013742 (1998)","journal-title":"Encycl. Comput. Chem."},{"issue":"1","key":"7_CR9","doi-asserted-by":"crossref","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":"1","key":"7_CR10","doi-asserted-by":"crossref","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":"7_CR11","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)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1007\/978-3-319-04657-0_30","volume-title":"Algorithms and Computation","author":"A Mukhopadhyay","year":"2014","unstructured":"Mukhopadhyay, A., Rao, S.V., Pardeshi, S., Gundlapalli, S.: Linear layouts of weakly triangulated graphs. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 322\u2013336. Springer, Heidelberg (2014)"},{"issue":"1","key":"7_CR13","doi-asserted-by":"crossref","first-page":"133","DOI":"10.7155\/jgaa.00317","volume":"18","author":"MS Alam","year":"2014","unstructured":"Alam, M.S., Mukhopadhyay, A.: More on generalized jewels and the point placement problem. J. Graph Algorithms Appl. 18(1), 133\u2013173 (2014)","journal-title":"J. Graph Algorithms Appl."},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2015)"},{"key":"7_CR15","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press and McGraw-Hill Book Company (1989)"},{"issue":"2","key":"7_CR16","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":"7_CR17","unstructured":"Pinkerton, B.: Results of a simulated annealing algorithm for fish mapping. Communicated by Dr. Larry Ruzzo, University of Washington (1993)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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)"},{"key":"7_CR19","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\u20133","key":"7_CR20","doi-asserted-by":"crossref","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."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42085-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T13:35:18Z","timestamp":1498311318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42085-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319420844","9783319420851"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42085-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}