tlooto
साइन अप
Computer ScienceMathematicsBiology

A time-efficient, linear-space local similarity algorithm

Xiaoqiu Huang, W. Miller

1991.9.1ADVANCES IN APPLIED MATHEMATICS

DOI: 10.1016/0196-8858(91)90017-d

tlooto सारांश

This paper presents a time-efficient algorithm that produces k best ''non-intersecting'' local alignments for any chosen k that needs only O(M + N + K) space.

सारांश

सार उपलब्ध नहीं है।

साइटेशन फॉर्मेट

HUANG, Xiaoqiu; MILLER, W. A time-efficient, linear-space local similarity algorithm. ADVANCES IN APPLIED MATHEMATICS, 1991, 12: 337–357.