Title
Identifying periodic occurrences of a template with applications to protein structure
Abstract
Consider a template P of size m in which each character matches many different characters with various degrees of perfection. Given a text T of size n, we present a simple and practical algorithm that finds the substring of T, which best matches some substring of P(n) (P(n) is the concatenation of an arbitrary number of copies of P). The algorithm produces the matched pair and their alignment in O(mn) time.
Year
DOI
Venue
1992
10.1016/0020-0190(93)90245-5
Inf. Process. Lett.
Keywords
DocType
Volume
periodic occurrence,protein structures,protein structure,identifying periodic occurrences
Conference
45
Issue
ISSN
ISBN
1
0020-0190
3-540-56024-6
Citations 
PageRank 
References 
29
4.68
5
Authors
4
Name
Order
Citations
PageRank
Vincent A. Fischetti1305.99
Gad M. Landau21558239.71
Peter H Sellers3265185.28
Jeanette P. Schmidt4611129.32