{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,17]],"date-time":"2026-08-17T23:14:30Z","timestamp":1787008470097,"version":"build-2736575974"},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005,1,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Motivation: Pair-wise alignment of protein sequences and local similarity searches produce many false positives because of compositionally biased regions, also called low-complexity regions (LCRs), of amino acid residues. Masking and filtering such regions significantly improves the reliability of homology searches and, consequently, functional predictions. Most of the available algorithms are based on a statistical approach. We wished to investigate the structural properties of LCRs in biological sequences and develop an algorithm for filtering them.<\/jats:p>\n                  <jats:p>Results: We present an algorithm for detecting and masking LCRs in protein sequences to improve the quality of database searches. We developed the algorithm based on the complexity analysis of subsequences delimited by a pair of identical, repeating subsequences. Given a protein sequence, the algorithm first computes the suffix tree of the sequence. It then collects repeating subsequences from the tree. Finally, the algorithm iteratively tests whether each subsequence delimited by a pair of repeating subsequences meets a given criteria. Test results with 1000 proteins from 20 families in Pfam show that the repeating subsequences are a good indicator for the low-complexity regions, and the algorithm based on such structural information strongly compete with others.<\/jats:p>\n                  <jats:p>Availability: \u00a0http:\/\/bioinfo.knu.ac.kr\/research\/CARD\/<\/jats:p>\n                  <jats:p>Contact: \u00a0swshin@bioinfo.knu.ac.kr<\/jats:p>","DOI":"10.1093\/bioinformatics\/bth497","type":"journal-article","created":{"date-parts":[[2004,8,27]],"date-time":"2004-08-27T21:15:02Z","timestamp":1093641302000},"page":"160-170","source":"Crossref","is-referenced-by-count":23,"title":["A new algorithm for detecting low-complexity regions in protein sequences"],"prefix":"10.1093","volume":"21","author":[{"given":"Sung W.","family":"Shin","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Kyungpook National University Daegu 702-701, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sam M.","family":"Kim","sequence":"additional","affiliation":[{"name":"Department of Computer Engineering, Kyungpook National University Daegu 702-701, Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2004,8,27]]},"reference":[{"key":"2023013107194218700_B1","doi-asserted-by":"crossref","unstructured":"Altschul, S.F., Boguski, M.S., Gish, W., Wootton, J.C. 1994Issue in searching molecular sequence database. Nat. Genet.6119\u2013129","DOI":"10.1038\/ng0294-119"},{"key":"2023013107194218700_B2","doi-asserted-by":"crossref","unstructured":"Altschul, S.F., Madden, T.L., Schaffer, A., Zhang, J., Zhang, Z., Miller, W., Lipman, D.J. 1997Grpped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res.253389\u20133402","DOI":"10.1093\/nar\/25.17.3389"},{"key":"2023013107194218700_B3","unstructured":"Bateman, A., Birney, E., Cerruti, L., Durbin, R., Etwiler, L., Eddy, S.R., Sam, G.-J., Howe, K.L., Marshall, M., Sonnhammer, E.L.L. 2002The Pfam Protein Families Database. Nucleic Acids Res.30276\u2013280"},{"key":"2023013107194218700_B4","unstructured":"Claverie, J.-M. and States, D.J. 1993Information enhancement methods for large scale sequence analysis. Comput. Chem.17191\u2013201"},{"key":"2023013107194218700_B5","doi-asserted-by":"crossref","unstructured":"Gusfield, D. Algorithms on Strings, Trees, and Sequence1997, NY  Cambridge University Press,  pp. 89\u2013107","DOI":"10.1017\/CBO9780511574931"},{"key":"2023013107194218700_B6","unstructured":"Harrison, M.A. Introduction to Formal Language Theory1978, Reading, MA  Addison-Wesley Publishing Company,  pp. 5\u20139"},{"key":"2023013107194218700_B7","unstructured":"Mount, D. Bioinformatics2000, AZ  CSHL Press, University of Arizona,  pp. 53\u2013203"},{"key":"2023013107194218700_B8","unstructured":"Needleman, S.B. and Wunsch, C.D. 1970A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. Mol. Biol.48443\u2013453"},{"key":"2023013107194218700_B9","doi-asserted-by":"crossref","unstructured":"Pearson, W.R. 1990Rapid and sensitive sequence comparison with FASTAP and FASTA. Methods Enzymol.18363\u201398","DOI":"10.1016\/0076-6879(90)83007-V"},{"key":"2023013107194218700_B10","doi-asserted-by":"crossref","unstructured":"Promponas, V.J., Enright, A.J., Tsoka, S., Kreil, D.P., Leroy, C., Hamodrakas, S., Sander, C., Ouzounis, C.A. 2000CAST: an iterative algorithm for the complexity analysis of sequence tracts. Bioinformatics16915\u2013922","DOI":"10.1093\/bioinformatics\/16.10.915"},{"key":"2023013107194218700_B11","doi-asserted-by":"crossref","unstructured":"Shannon, C.E. 1951Prediction and entropy of printed English. Bell Syst. Tech. J.50\u201360","DOI":"10.1002\/j.1538-7305.1951.tb01366.x"},{"key":"2023013107194218700_B12","unstructured":"Smith, T.F. and Waterman, M.S. 1981Identification of common molecular subsequence. J. Mol. Biol.147195\u2013197"},{"key":"2023013107194218700_B13","unstructured":"Ukkonen, E. 1995On-line construction of suffix-tree. Algorithmica14249\u2013260"},{"key":"2023013107194218700_B14","doi-asserted-by":"crossref","unstructured":"Weiner, P. 1973Linear pattern matching algorithms. Proceedings of the 14th IEEE symposium on Switching and Automata Theory , Washington, DC ,  pp. 1\u201311","DOI":"10.1109\/SWAT.1973.13"},{"key":"2023013107194218700_B15","unstructured":"Wootton, J.C. 1994Sequence with \u2018unusual\u2019 amino acid composition. Curr. Opin. Struct. Biol.14413\u2013421"},{"key":"2023013107194218700_B16","unstructured":"Wootton, J.C. and Federhen, S. 1993Statistics of local complexity in amino acid sequence and sequence database. Comput. Chem.17149\u2013163"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/2\/160\/48962015\/bioinformatics_21_2_160.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/21\/2\/160\/48962015\/bioinformatics_21_2_160.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T04:57:58Z","timestamp":1675141078000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/21\/2\/160\/187330"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,27]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2005,1,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bth497","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2005,1,15]]},"published":{"date-parts":[[2004,8,27]]}}}