Indexed by：
Abstract：
Based on a new way to compute check points, this paper presents a ＇Block Recursive＇ sequence alignment algorithm, which can run in a time requirement between 1.5mn and 3mn in general cases but between 1.5mn and 2mn for sequences with high similarities. Still, the algorithm keeps a linear space requirement and always guarantees an optimal alignment result. Some experiments show that it runs at least 10% faster than the Hirschberg algorithm if the two compared sequences has a normalized edit distance less than 0.25. © 2008 IEEE.
Keyword：
Reprint Author's Address：
Email：
Source ：
Year： 2008
Page： 604-607
Language： English
Cited Count：
WoS CC Cited Count： 0
SCOPUS Cited Count：
ESI Highly Cited Papers on the List： 0 Unfold All
WanFang Cited Count：
Chinese Cited Count：
30 Days PV： 11
Affiliated Colleges：
