{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:53:22Z","timestamp":1742392402271},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,12,1]],"date-time":"2008-12-01T00:00:00Z","timestamp":1228089600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1186\/1471-2105-9-534","type":"journal-article","created":{"date-parts":[[2008,12,16]],"date-time":"2008-12-16T19:14:13Z","timestamp":1229454853000},"source":"Crossref","is-referenced-by-count":3,"title":["Optimal neighborhood indexing for protein similarity search"],"prefix":"10.1186","volume":"9","author":[{"given":"Pierre","family":"Peterlongo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"No\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominique","family":"Lavenier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Van Hoa","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mathieu","family":"Giraud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2008,12,16]]},"reference":[{"key":"2519_CR1","doi-asserted-by":"crossref","unstructured":"Smith T, Waterman M: Identification of common molecular subsequences. Journal of Molecular Biology 1981., 147(195\u2013197):","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"2519_CR2","first-page":"679","volume-title":"Symposium On Discrete Algorithms (SODA 02)","author":"M Crochemore","year":"2002","unstructured":"Crochemore M, Landau G, Ziv-Ukelson M: A Sub-quadratic Sequence Alignment Algorithm for Unrestricted Cost Matrices. Symposium On Discrete Algorithms (SODA 02) 2002, 679\u2013688."},{"key":"2519_CR3","doi-asserted-by":"publisher","first-page":"2444","DOI":"10.1073\/pnas.85.8.2444","volume":"85","author":"D Lipman","year":"1988","unstructured":"Lipman D, Pearson W: Improved tools for biological sequence comparison. Proc Natl Acad Sci USA 1988, 85: 2444\u20132448. 10.1073\/pnas.85.8.2444","journal-title":"Proc Natl Acad Sci USA"},{"issue":"3","key":"2519_CR4","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"S Altschul","year":"1990","unstructured":"Altschul S, Gish W, Miller W, Myers W, Lipman D: Basic local alignment search tool. Journal of Molecular Biology 1990, 215(3):403\u2013410.","journal-title":"Journal of Molecular Biology"},{"issue":"17","key":"2519_CR5","doi-asserted-by":"publisher","first-page":"3389","DOI":"10.1093\/nar\/25.17.3389","volume":"25","author":"S Altschul","year":"1997","unstructured":"Altschul S, Madden T, Sch\u00e4ffer A, Zhang J, Zhang Z, Miller W, Lipman D: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Research 1997, 25(17):3389\u20133402. 10.1093\/nar\/25.17.3389","journal-title":"Nucleic Acids Research"},{"issue":"3","key":"2519_CR6","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1142\/S0219720004000661","volume":"2","author":"M Li","year":"2004","unstructured":"Li M, Ma B, Kisman D, Tromp J: PatternHunter II: Highly Sensitive and Fast Homology Search. Journal of Bioinformatics and Computational Biology 2004, 2(3):417\u2013439. [(early version in GIW 2003)]. 10.1142\/S0219720004000661","journal-title":"Journal of Bioinformatics and Computational Biology"},{"key":"2519_CR7","doi-asserted-by":"publisher","first-page":"W540","DOI":"10.1093\/nar\/gki478","volume":"33","author":"L No\u00e9","year":"2005","unstructured":"No\u00e9 L, Kucherov G: YASS: enhancing the sensitivity of DNA similarity search. Nucleic Acids Research 2005, 33: W540-W543. 10.1093\/nar\/gki478","journal-title":"Nucleic Acids Research"},{"key":"2519_CR8","first-page":"126","volume-title":"A survey of seeding for sequence alignment","author":"DG Brown","year":"2008","unstructured":"Brown DG: Bioinformatics Algorithms: Techniques and Applications. In A survey of seeding for sequence alignment. Wiley-Interscience (I. Mandoiu, A. Zelikovsky); 2008:126\u2013152."},{"key":"2519_CR9","volume-title":"Parallel Biocomputing Conference (PBC 07), Volume 4967 of Lecture Notes in Computer Science (LNCS)","author":"P Peterlongo","year":"2007","unstructured":"Peterlongo P, No\u00e9 L, Lavenier D, Georges G, Jacques J, Kucherov G, Giraud M: Protein similarity search with subset seeds on a dedicated reconfigurable hardware. Parallel Biocomputing Conference (PBC 07), Volume 4967 of Lecture Notes in Computer Science (LNCS) 2007."},{"key":"2519_CR10","volume-title":"6th International Conference on research, innovation and vision for the future","author":"VH Nguyen","year":"2008","unstructured":"Nguyen VH, Lavenier D: Speeding up Subset Seed Algorithm for Intensive Protein Sequence Comparison. 6th International Conference on research, innovation and vision for the future 2008."},{"issue":"4","key":"2519_CR11","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1101\/gr.229202. Article published online before March 2002","volume":"12","author":"WJ Kent","year":"2002","unstructured":"Kent WJ: BLAT-the BLAST-like alignment tool. Genome Res 2002, 12(4):656\u2013664.","journal-title":"Genome Res"},{"key":"2519_CR12","volume-title":"Computer Architecture, A Quantitative Approach","author":"JL Hennessy","year":"2006","unstructured":"Hennessy JL, Patterson DA: Computer Architecture, A Quantitative Approach. Morgan Kaufmann; 2006."},{"issue":"3","key":"2519_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/protein\/13.3.149","volume":"13","author":"L Murphy","year":"2000","unstructured":"Murphy L, Wallqvist A, Ronald L: Simplified amino acid alphabets for protein fold recognition and implications for folding. Protein Engineering 2000, 13(3):149\u2013152. 10.1093\/protein\/13.3.149","journal-title":"Protein Engineering"},{"issue":"8","key":"2519_CR14","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 algorithm and substitution matrices. Bioinformatic 2002, 18(8):1102\u20131108. 10.1093\/bioinformatics\/18.8.1102","journal-title":"Bioinformatic"},{"issue":"5","key":"2519_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1093\/protein\/gzg044","volume":"16","author":"T Li","year":"2003","unstructured":"Li T, Fan K, Wang J, Wang W: Reduction of protein sequence complexity by residue grouping. Protein Engineering 2003, 16(5):323\u2013330. 10.1093\/protein\/gzg044","journal-title":"Protein Engineering"},{"key":"2519_CR16","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1093\/nar\/gkh180","volume":"32","author":"R Edgar","year":"2004","unstructured":"Edgar R: Local homology recognition and distance measures in linear time using compressed amino acid alphabets. Nucleic Acids Research 2004, 32: 380\u2013385. 10.1093\/nar\/gkh180","journal-title":"Nucleic Acids Research"},{"key":"2519_CR17","unstructured":"ReBLOSUM:: Rectangular BLOSUM Matrices[ http:\/\/bioinfo.lifl.fr\/reblosum\/ ]"},{"key":"2519_CR18","doi-asserted-by":"publisher","first-page":"10915","DOI":"10.1073\/pnas.89.22.10915","volume":"89","author":"J Henikoff","year":"1992","unstructured":"Henikoff J, Henikoff S: Amino Acid Substitution Matrices form Protein Blocks. Proc Natl Acad Sci USA 1992, 89: 10915\u201310919. 10.1073\/pnas.89.22.10915","journal-title":"Proc Natl Acad Sci USA"},{"issue":"6","key":"2519_CR19","doi-asserted-by":"publisher","first-page":"2264","DOI":"10.1073\/pnas.87.6.2264","volume":"87","author":"S Karlin","year":"1990","unstructured":"Karlin S, Altschul SF: Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes. Proc Natl Acad Sci USA 1990, 87(6):2264\u20132268. 10.1073\/pnas.87.6.2264","journal-title":"Proc Natl Acad Sci USA"},{"key":"2519_CR20","doi-asserted-by":"publisher","first-page":"1435","DOI":"10.1126\/science.2983426","volume":"227","author":"D Lipman","year":"1985","unstructured":"Lipman D, Pearson W: Rapid and Sensitive Protein Similarity Searches. Science 1985, 227: 1435\u20131441. 10.1126\/science.2983426","journal-title":"Science"},{"key":"2519_CR21","first-page":"466","volume":"13","author":"M Roytberg","year":"2008","unstructured":"Roytberg M, Gambin A, No\u00e9 L, Lasota S, Furletova E, Szczurek E, Kucherov G: Efficient seeding techniques for protein similarity search. Bioinformatics Research and Development, Proceedings of the 2nd International Conference BIRD 2008, Vienna (Austria), July 7\u20139, 2008, of Communications in Computer and Information Science, Springer Verlag 2008, 13: 466\u2013478.","journal-title":"Bioinformatics Research and Development, Proceedings of the 2nd International Conference BIRD 2008, Vienna (Austria), July 7\u20139, 2008, of Communications in Computer and Information Science, Springer Verlag"},{"key":"2519_CR22","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: Amino acid substitution matrices from protein blocks. Proc Natl Acad Sci USA 1992, 89: 10915\u201310919. 10.1073\/pnas.89.22.10915","journal-title":"Proc Natl Acad Sci USA"},{"issue":"23","key":"2519_CR23","doi-asserted-by":"publisher","first-page":"6565","DOI":"10.1093\/nar\/19.23.6565","volume":"19","author":"S Henikoff","year":"1991","unstructured":"Henikoff S, Henikoff J: Automated assembly of protein blocks for database searching. Nucleic Acids Res 1991, 19(23):6565\u20136572. 10.1093\/nar\/19.23.6565","journal-title":"Nucleic Acids Res"},{"key":"2519_CR24","unstructured":"Blosum database[ http:\/\/sci.cnb.uam.es\/Services\/ftp\/databases\/blocks\/unix\/blosum\/ ]"},{"issue":"3","key":"2519_CR25","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1038\/nbt0308-274","volume":"26","author":"MP Styczynski","year":"2008","unstructured":"Styczynski MP, Jensen KL, Rigoutsos I, Stephanopoulos G: BLOSUM62 miscalculations improve search performance. Nat Biotech 2008, 26(3):274\u2013275. 10.1038\/nbt0308-274","journal-title":"Nat Biotech"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-9-534.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1471-2105-9-534\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-9-534.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T09:49:43Z","timestamp":1558000183000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-9-534"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,12]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["2519"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-9-534","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,12]]},"article-number":"534"}}