论文信息 - Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory. - 字舞流文

Efficient optimal decomposition of a sequence into disjoint regions, each matched to some template in an inventory.

[1] J. Pipas,et al. Method for predicting RNA secondary structure. , 1975, Proceedings of the National Academy of Sciences of the United States of America.

[2] Michael S. Waterman,et al. Locating maximum variance segments in sequential data , 1977 .

[3] M S Waterman,et al. Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[4] C. Myers,et al. A level building dynamic time warping algorithm for connected word recognition , 1981 .

[5] E. Myers,et al. Approximate matching of regular expressions , 1989 .

[6] C. Lawrence,et al. Algorithms for the optimal identification of segment neighborhoods , 1989 .