{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T08:48:53Z","timestamp":1746521333734},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"S8","content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2013,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>A weighted biological sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. We attempt to locate all the tandem repeats in a weighted sequence. A repeated substring is called a tandem repeat if each occurrence of the substring is directly adjacent to each other. By introducing the idea of equivalence classes in weighted sequences, we identify the tandem repeats of every possible length using an iterative partitioning technique. We also present the algorithm for recording the tandem repeats, and prove that the problem can be solved in <jats:italic>O<\/jats:italic>(<jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>) time.<\/jats:p>","DOI":"10.1186\/1471-2105-14-s8-s2","type":"journal-article","created":{"date-parts":[[2013,5,9]],"date-time":"2013-05-09T10:16:31Z","timestamp":1368094591000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Locating tandem repeats in weighted sequences in proteins"],"prefix":"10.1186","volume":"14","author":[{"given":"Hui","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Qing","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Costas S","family":"Iliopoulos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,5,9]]},"reference":[{"key":"5855_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield D: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. 1997, Cambridge University Press"},{"key":"5855_CR2","unstructured":"The Human Genome Project(HGP). [http:\/\/http;\/\/www.nbgri.nih.gov\/HGP\/]"},{"key":"5855_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF02104737","volume":"20","author":"S Ohno","year":"1984","unstructured":"Ohno S: Repeats of base oligomers as the primordial coding sequences of the primeval earth and their vestiges in modern genes. Journal of Molecular Evolution. 1984, 20: 313-321. 10.1007\/BF02104737.","journal-title":"Journal of Molecular Evolution"},{"key":"5855_CR4","first-page":"1423","volume-title":"Friedreichs ataxiaautosomal recessive disease caused by an intronic gaa triplet repeat expansionScience","author":"V Campuzano","year":"1996","unstructured":"Campuzano V, Montermini L, Molto MD: Friedreichs ataxiaautosomal recessive disease caused by an intronic gaa triplet repeat expansionScience. 1996, 271: 1423-1427."},{"key":"5855_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1186\/1471-2164-11-277","volume":"11","author":"C Mayer","year":"2010","unstructured":"Mayer C, Leese F, Tollrian R: Genome-wide analysis of tandem repeats in Daphnia pulex - a comparative approach. BMC Genomics. 2010, 11: 277-10.1186\/1471-2164-11-277.","journal-title":"BMC Genomics"},{"issue":"5","key":"5855_CR6","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/0020-0190(81)90024-7","volume":"12","author":"M Crochemore","year":"1981","unstructured":"Crochemore M: An Optimal Algorithm for Computing the Repetitions in a Word. Information Processing Letter. 1981, 12 (5): 244-250. 10.1016\/0020-0190(81)90024-7.","journal-title":"Information Processing Letter"},{"key":"5855_CR7","first-page":"422","volume-title":"An O(nlngn) algorithm for finding all repetitions in a stringJournal of Algorithms","author":"MG Main","year":"1984","unstructured":"Main MG, Lorentz RJ: An O(nlngn) algorithm for finding all repetitions in a stringJournal of Algorithms. 1984, 5: 422-432."},{"key":"5855_CR8","first-page":"297","volume-title":"Optimal off-line detection of repetitions in a stringTheoretical Computer Science","author":"A Apostolico","year":"1983","unstructured":"Apostolico A, Prepamta FP: Optimal off-line detection of repetitions in a stringTheoretical Computer Science. 1983, 22: 297-315."},{"key":"5855_CR9","first-page":"57","volume-title":"Suffix trees and their Applications in String AlgorithmsInProc 1st South American Workshop on String Processing (WSP1993)","author":"R Grossi","year":"1993","unstructured":"Grossi R, Italiano GF: Suffix trees and their Applications in String AlgorithmsInProc 1st South American Workshop on String Processing (WSP1993). 1993, 57-76."},{"key":"5855_CR10","first-page":"935","volume-title":"Suffix arrays: a new method for on-Line string searches, SIAM Journal on Computing","author":"U Manber","year":"1993","unstructured":"Manber U, Myers G: Suffix arrays: a new method for on-Line string searches, SIAM Journal on Computing. 1993, 22 (5): 935-948."},{"key":"5855_CR11","first-page":"140","volume-title":"Simple and flexible detection of contiguous repeats using a suffix treeInFarachM","author":"J Stoye","year":"1998","unstructured":"Stoye J, Gusfield D: Simple and flexible detection of contiguous repeats using a suffix treeInFarachM. 1998, Springer, Berlin, 1448: 140-152. CPM98LNCS","edition":"CPM98LNCS"},{"issue":"4","key":"5855_CR12","first-page":"579","volume":"8","author":"F Fran\u00eak","year":"2003","unstructured":"Fran\u00eak F, Smyth WF, Tang Y: Computing All Repeats Using Suffix Arrays. Journal of Automata, Languages and Combinatorics. 2003, 8 (4): 579-591.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"5855_CR13","first-page":"265","volume":"147","author":"CS Iliopoulos","year":"2004","unstructured":"Iliopoulos CS, Makris C, Panagis Y, Perdikuri K, Theodoridis E, Tsakalidis A: Efficient Algorithms for Handling Molecular Weighted Sequences. IFIP Theoretical Computer Science. 2004, 147: 265-278.","journal-title":"IFIP Theoretical Computer Science"},{"key":"5855_CR14","first-page":"91","volume-title":"Proc of the 8th Prague Stringology Conference (PSC 2003)","author":"CS Iliopoulos","year":"2003","unstructured":"Iliopoulos CS, Mouchard L, Perdikuri K, Tsakalidis A: Computing the repetitions in a weighted sequence. Proc of the 8th Prague Stringology Conference (PSC 2003). 2003, 91-98."},{"issue":"6","key":"5855_CR15","doi-asserted-by":"publisher","first-page":"1214C","DOI":"10.1089\/cmb.2006.13.1214","volume":"13","author":"M Christodoulakis","year":"2006","unstructured":"Christodoulakis M, Iliopoulos CS, Mouchard L, Perdikuri K, Tsakalidis A, Tsichlas K: Computation of repetitions and regularities on biological weighted sequences. Journal of Computational Biology. 2006, 13 (6): 1214C-1231. 10.1089\/cmb.2006.13.1214.","journal-title":"Journal of Computational Biology"},{"key":"5855_CR16","first-page":"701","volume-title":"Proc of the International Conference of Computational Methods in Science and Engineering, Lecture Series on Computer and Computational Sciences","author":"M Christodoulakis","year":"2004","unstructured":"Christodoulakis M, Iliopoulos CS, Perdikuri K, Tsichlas K: Searching the regularities in weighted sequences. Proc of the International Conference of Computational Methods in Science and Engineering, Lecture Series on Computer and Computational Sciences. 2004, Springer Verlag, 701-704."},{"key":"5855_CR17","first-page":"2293","volume-title":"Classifying protein sequences using hydropathy blocks, Pattern Recognition","author":"DS Huang","year":"2006","unstructured":"Huang DS, Zhao XM, Huang GB, Cheung YM: Classifying protein sequences using hydropathy blocks, Pattern Recognition. 2006, 39 (12): 2293-2300."},{"issue":"174","key":"5855_CR18","first-page":"1","volume":"11","author":"JF Xia","year":"2010","unstructured":"Xia JF, Zhao XM, Song JN, Huang DS: APIS: accurate prediction of hot spots in protein interfaces by combining protrusion index with solvent accessibility. BMC Bioinformatics. 2010, 11 (174): 1-14.","journal-title":"BMC Bioinformatics"},{"issue":"21","key":"5855_CR19","doi-asserted-by":"publisher","first-page":"2744","DOI":"10.1093\/bioinformatics\/btq510","volume":"26","author":"ZH You","year":"2010","unstructured":"You ZH, Lei YK, Huang DS, Zhou XB: Using manifold embedding for assessing and predicting protein interactions from high-throughput experimental data. Bioinformatics. 2010, 26 (21): 2744-2751. 10.1093\/bioinformatics\/btq510.","journal-title":"Bioinformatics"},{"issue":"4","key":"5855_CR20","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/TITB.2009.2018115","volume":"13","author":"CH Zheng","year":"2009","unstructured":"Zheng CH, Huang DS, Zhang L, Kong XZ: Tumor clustering using non-negative matrix factorization with gene selection. IEEE Transactions on Information Technology in Biomedicine. 2009, 13 (4): 599-607.","journal-title":"IEEE Transactions on Information Technology in Biomedicine"},{"issue":"2","key":"5855_CR21","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1109\/TCBB.2011.135","volume":"9","author":"SL Wang","year":"1012","unstructured":"Wang SL, Zhu YH, Jia W, Huang DS: Robust classification method of tumor subtype by using correlation filters. IEEE\/ACM Transactions on Computational Biology and Bioinformatics. 1012, 9 (2): 580-591.","journal-title":"IEEE\/ACM Transactions on Computational Biology and Bioinformatics"},{"key":"5855_CR22","first-page":"1136","volume-title":"Loose and strict repeats in weighted sequences. Protein and Peptide Letters","author":"H Zhang","year":"2010","unstructured":"Zhang H, Guo Q, Iliopoulos CS: Loose and strict repeats in weighted sequences. Protein and Peptide Letters. 2010, 17 (9): 1136-1142."},{"key":"5855_CR23","unstructured":"European Bioinformatics Institute (EMBL-EBI): ClustalW. [http:\/\/www.ebi.ac.uk\/clustalw]"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/1471-2105-14-S8-S2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T23:42:47Z","timestamp":1630539767000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/1471-2105-14-S8-S2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":23,"journal-issue":{"issue":"S8","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["5855"],"URL":"https:\/\/doi.org\/10.1186\/1471-2105-14-s8-s2","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"9 May 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"S2"}}