{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:24:51Z","timestamp":1725513891215},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540717829"},{"type":"electronic","value":"9783540717836"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-71783-6_12","type":"book-chapter","created":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T07:45:57Z","timestamp":1182325557000},"page":"122-131","source":"Crossref","is-referenced-by-count":4,"title":["Simplifying Amino Acid Alphabets Using a Genetic Algorithm and Sequence Alignment"],"prefix":"10.1007","author":[{"given":"Jacek","family":"Lenckowski","sequence":"first","affiliation":[]},{"given":"Krzysztof","family":"Walczak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Andorf, C.M., Dobbs, D.L., Honavar, V.G.: Discovering protein function classification rules from reduced alphabet representation of protein sequences. In: Proceedings of the Conference on Computational Biology and Genome Informatics, Durham, North Carolina (2002)"},{"issue":"8","key":"12_CR2","doi-asserted-by":"publisher","first-page":"1102","DOI":"10.1093\/bioinformatics\/18.8.1102","volume":"18","author":"N. Cannata","year":"2002","unstructured":"Cannata, N., Toppo, S., Romualdi, C., Valle, G.: Simplifying amino acid alphabets by means of a branch and bound algorithm and substitution matrices. Bioinformatics\u00a018(8), 1102\u20131108 (2002)","journal-title":"Bioinformatics"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1016\/S0022-2836(03)00324-3","volume":"328","author":"K. Fan","year":"2003","unstructured":"Fan, K., Wang, W.: What is the Minimum Number of Letters Required to Fold a Protein? J. Mol. Biol.\u00a0328, 921\u2013926 (2003)","journal-title":"J. Mol. Biol."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","volume":"89","author":"S. Henikoff","year":"1992","unstructured":"Henikoff, S., Henikoff, J.G.: Amino acid substitution matrices from protein blocks. Proc. Natl. Acad. Sci. USA\u00a089, 10915\u201310919 (1992)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"12_CR5","unstructured":"Jaakkolay, T., Diekhansz, M., Hausslerz, D.A.: discriminative framework for detecting remote protein homologies (1999), \n                  \n                    http:\/\/www.cse.ucsc.edu\/research\/compbio\/research.html"},{"issue":"5","key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0217984903005159","volume":"17","author":"T. Li","year":"2003","unstructured":"Li, T., Wang, J., Fan, K., Wang, W.: How simple can the proteins be: from the prediction of the classes of protein structures. Modern Physics Letters B\u00a017(5), 1\u20138 (2003)","journal-title":"Modern Physics Letters B"},{"key":"12_CR7","doi-asserted-by":"crossref","first-page":"021906","DOI":"10.1103\/PhysRevE.66.021906","volume":"66","author":"X. Liu","year":"2002","unstructured":"Liu, X., Liu, D., Qi, J., Zheng, W.: Simplified amino acid alphabets based on deviation of conditional probability from random background. Physical Review E 66, 021906 (2002)","journal-title":"Physical Review E"},{"key":"12_CR8","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1006\/jmbi.1996.0114","volume":"256","author":"S. Miyazawa","year":"1996","unstructured":"Miyazawa, S., Jernigan, R.L.: Residue-Residue Potentials with a Favorable Contact Pair Term and an Unfavorable High Packing Density Term for Simulation and Threading. J. Mol. Biol.\u00a0256, 623\u2013644 (1996)","journal-title":"J. Mol. Biol."},{"issue":"3","key":"12_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/protein\/13.3.149","volume":"13","author":"L.R. Murphy","year":"2000","unstructured":"Murphy, L.R., Wallqvist, A., Levy, R.M.: Simplified amino acid alphabets for protein fold recognition and implications for folding. Protein Engineering\u00a013(3), 149\u2013152 (2000)","journal-title":"Protein Engineering"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Palensky, M., Hesham, A.: A Genetic Algorithm for Simplifying The Amino Acid Alphabet. In: Computer Society Bioinformatics Conference, CSB2003 (2003)","DOI":"10.1109\/CSB.2003.1227418"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1016\/S0014-5793(99)01557-4","volume":"462","author":"P. Romero","year":"1999","unstructured":"Romero, P., Obradovic, Z., Dunker, A.K.: Folding minimal sequences: the lower bound for sequence complexity of globular proteins. FEBS Letters\u00a0462, 363\u2013367 (1999)","journal-title":"FEBS Letters"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"1372","DOI":"10.1016\/j.patcog.2004.03.021","volume":"38","author":"Y. Sakakibara","year":"2005","unstructured":"Sakakibara, Y.: Learning context-free grammars using tabular representations. Pattern Recognition\u00a038, 1372\u20131383 (2005)","journal-title":"Pattern Recognition"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation,Machine Learning and Data Mining in Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71783-6_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:26:06Z","timestamp":1605763566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71783-6_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540717829","9783540717836"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71783-6_12","relation":{},"subject":[]}}