13th IEEE International Conference on BioInformatics and BioEngineering (2005)
Oct. 19, 2005 to Oct. 21, 2005
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/BIBE.2005.49
Xiaolu Huang , University of Nebraska at Omaha
Hesham Ali , University of Nebraska at Omaha
Anguraj Sadanandam , University of Nebraska Medical Center
Rakesh Singh , University of Nebraska Medical Center
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.
A. Sadanandam, H. Ali, R. Singh and X. Huang, "Protein Motif Searching Through Similar Enriched Parikh Vector Identification," 13th IEEE International Conference on BioInformatics and BioEngineering(BIBE), Minneapolis, Minnesota, 2005, pp. 285-289.