Browse > Article

Algorithm for identifying cross-linked protein subsequences  

Kim, Sung-Kwon (Dept.of Computer Engineering, Chungang University)
Abstract
We are considering the following problem that can be used in the prediction of the structure of proteins. Given two length n arrays A, B with positive numbers and a positive number M, find all pairs of subarrays A[i]+…A[j],$1{\leq}i{\leq}j{\leq}n$ such that A[i]+…A[j]+B[k]+…B[l]=M. This paper presents an algorithm with $Ο(n^2log n+K)$ time using Ο(n) memory, where K is the number of pairs output. The previously best known one is with $Ο(n^2log +Klog n)$ time and Ο(n) memory.
Keywords
cross links; protein sequences;
Citations & Related Records
연도 인용수 순위
  • Reference
1 T. Chen, J.D. Jaffe, and G.M. Church, Algorithms for identifying cross-links via tandem mass spectrometry, Proceedings of the Fifth Annual International Conference on Computational Biology(RECOMB 2001), pages 95--102 (2001)   DOI
2 E. Horowitz, S. Sahni, and S. Anderson-Freed, Fundamentals of Data Structures in C, Computer Science Press, 1993