TY - GEN
T1 - Protein motif searching through similar enriched parikh vector identification
AU - Huang, Xiaolu
AU - Ali, Hesham
AU - Sadanandam, Anguraj
AU - Singh, Rakesh
PY - 2005
Y1 - 2005
N2 - Biological researches have shown that some protein regions sharing similar functions or structures have inversed-ordered or highly dispersed sequence similarities and some intra-sequence similarities such as palindrome repeats also play important roles in protein folding. The current protein analysis tools cannot detect these "nontraditional" similarities. Although some tools can be modified for searching intra-sequence inversed or forward ordered similarities, their maximally optimal path processes will miss many suboptimal biologically meaningful similarities. The Similar enRiched Parikh Vector Searching (SRPVS) algorithm searches similarities by separating the subsequence composition and order information. The SRPVS first breaks sequences into groups of predefined-sized subsequences, each represented by an enRiched Parikh Vector (RPV); then Similar RPV pairs (SRPV) are searched in each nonoverlapping RPV pair based on various order restrictions - forward, inversed, or shuffled. In this study, SRPVS has been applied to the protein ligand motif finding and the intra-sequence protein inversed repeats finding.
AB - Biological researches have shown that some protein regions sharing similar functions or structures have inversed-ordered or highly dispersed sequence similarities and some intra-sequence similarities such as palindrome repeats also play important roles in protein folding. The current protein analysis tools cannot detect these "nontraditional" similarities. Although some tools can be modified for searching intra-sequence inversed or forward ordered similarities, their maximally optimal path processes will miss many suboptimal biologically meaningful similarities. The Similar enRiched Parikh Vector Searching (SRPVS) algorithm searches similarities by separating the subsequence composition and order information. The SRPVS first breaks sequences into groups of predefined-sized subsequences, each represented by an enRiched Parikh Vector (RPV); then Similar RPV pairs (SRPV) are searched in each nonoverlapping RPV pair based on various order restrictions - forward, inversed, or shuffled. In this study, SRPVS has been applied to the protein ligand motif finding and the intra-sequence protein inversed repeats finding.
UR - http://www.scopus.com/inward/record.url?scp=33751175173&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33751175173&partnerID=8YFLogxK
U2 - 10.1109/BIBE.2005.49
DO - 10.1109/BIBE.2005.49
M3 - Conference contribution
AN - SCOPUS:33751175173
SN - 0769524761
SN - 9780769524764
T3 - Proceedings - BIBE 2005: 5th IEEE Symposium on Bioinformatics and Bioengineering
SP - 285
EP - 289
BT - Proceedings - BIBE 2005
T2 - BIBE 2005: 5th IEEE Symposium on Bioinformatics and Bioengineering
Y2 - 19 October 2005 through 21 October 2005
ER -