{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T14:06:38Z","timestamp":1770818798106,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,7,1]],"date-time":"2011-07-01T00:00:00Z","timestamp":1309478400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s11390-011-1157-0","type":"journal-article","created":{"date-parts":[[2011,7,11]],"date-time":"2011-07-11T18:24:35Z","timestamp":1310408675000},"page":"569-577","source":"Crossref","is-referenced-by-count":18,"title":["Understanding Science Through the Computational Lens"],"prefix":"10.1007","volume":"26","author":[{"given":"Richard M.","family":"Karp","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,7,11]]},"reference":[{"key":"1157_CR1","unstructured":"Sloan Digital Sky Survey. http:\/\/www.sdss.org\/ ."},{"key":"1157_CR2","unstructured":"The Group of Theory at Berkeley Website. http:\/\/theo-ry.cs.berkeley.edu\/ ."},{"key":"1157_CR3","unstructured":"Papadimitriou C H. The algorithmic lens: How the computational perspective is transforming the sciences. In 2007 Federated Computing Research Conference, Speech, San Diego, USA, Jun. 8\u201316, 2007."},{"key":"1157_CR4","unstructured":"Papadimitriou C H. Algorithms, Games, and the Internet. In Proc. STOC\/ICALP 2001, Heraklion, Greece, July 6\u20138, 2001, pp.749-753."},{"key":"1157_CR5","doi-asserted-by":"crossref","unstructured":"van Dam W, Mosca M, Vazirani U. How powerful is adiabatic quantum computation. In Proc. Symposium on the Foundation of Computer Science, Las Vegas, USA, Oct. 14\u201317, 2001, p.279.","DOI":"10.1109\/SFCS.2001.959902"},{"key":"1157_CR6","doi-asserted-by":"crossref","unstructured":"Mossel E, Peres Y, Sinclair A. Shuffling by semi-random transpositions. Mathematics arXiv math.PR\/0404438, April 2004, Conference version appeared in Proc. IEEE FOCS 2004, Rome, Italy, Oct. 17\u201319, pp.572-581.","DOI":"10.1109\/FOCS.2004.60"},{"issue":"29","key":"1157_CR7","doi-asserted-by":"crossref","first-page":"10523","DOI":"10.1073\/pnas.0403564101","volume":"101","author":"EP Xing","year":"2004","unstructured":"Xing E P, Karp R M. MotifPrototyper: A Bayesian profile model for motif families. Proc. Nat. Acad. Sci., USA, Jul. 20, 2004, 101(29): 10523\u201310528.","journal-title":"Proc. Nat. Acad. Sci., USA"},{"issue":"3\/4","key":"1157_CR8","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1089\/10665270360688075","volume":"10","author":"A Ben-Dor","year":"2003","unstructured":"Ben-Dor A, Chor B, Karp R, Yakhini Z. Discovering local structure in gene expression data: The order preserving submatrix problem. Journal of Computational Biology, 2003, 10(3\/4): 373\u2013384.","journal-title":"Journal of Computational Biology"},{"key":"1157_CR9","unstructured":"Aaronson S. The Limits of Quantum Computers. http:\/\/www.scottaaronson.com\/talks\/sipbtalk.ppt ."},{"key":"1157_CR10","unstructured":"Albert Einstein. Letter to Max Born (4 December 1926). The Born-Einstein Letters, translated by Irene Born, New York: Walker and Company, 1971, ISBN 0-8027-0326-7. This quote is commonly paraphrased \u201cGod does not play dice\u201d or \u201cGod does not play dice with the universe\u201d, and other slight variants."},{"key":"1157_CR11","doi-asserted-by":"crossref","unstructured":"Shor P. Algorithms for quantum computation: Discrete logarithms and factoring. In Proc. the 35th Annual Symposium on Foundations of Computer Science, Los Alamitos, USA, Nov. 20\u201322, 1994, pp.124-134.","DOI":"10.1109\/SFCS.1994.365700"},{"issue":"4","key":"1157_CR12","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M Jerrum","year":"2004","unstructured":"Jerrum M, Sinclair A, Vigoda E. A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. Journal of the ACM, 2004, 51(4): 671\u2013697.","journal-title":"Journal of the ACM"},{"issue":"2","key":"1157_CR13","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1002\/rsa.20057","volume":"27","author":"A Braunstein","year":"2005","unstructured":"Braunstein A, M\u00e9zard M, Zecchina R. Survey propagation: An algorithm for satisfiability. Random structures & Algorithms, 2005, 27(2): 201\u2013226.","journal-title":"Random structures & Algorithms"},{"key":"1157_CR14","doi-asserted-by":"crossref","unstructured":"Etessami K, Yannakakis M. On the complexity of Nash equilibria and other fixed points. In Proc. the 48th IEEE Symp. Foundations of Computer Science (FOCS), Providence, USA, Oct. 20\u201323, 2007, pp.113-123.","DOI":"10.1109\/FOCS.2007.39"},{"key":"1157_CR15","doi-asserted-by":"crossref","unstructured":"Nisan N, Roughgarden T, Tardos E, Vazirani V\u00a0V (eds.). Algorithmic Game Theory. Cambridge University Press, 2007.","DOI":"10.1017\/CBO9780511800481"},{"key":"1157_CR16","unstructured":"Cipra B A. Some assembly required. SIAM News. Dec. 1, 2003, 36(10)."},{"key":"1157_CR17","unstructured":"Davidson E H. Genomic Regulatory Systems: Development and Evolution. Academic Press, 2001."},{"key":"1157_CR18","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1038\/nbt0406-423","volume":"24","author":"P D\u2019haeseleer","year":"2006","unstructured":"Patrik D\u2019haeseleer. What are DNA sequence motifs? Nature Biotechnology, 2006, 24: 423\u2013425.","journal-title":"Nature Biotechnology"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-011-1157-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-011-1157-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-011-1157-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T01:43:47Z","timestamp":1741311827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-011-1157-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["1157"],"URL":"https:\/\/doi.org\/10.1007\/s11390-011-1157-0","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7]]}}}