Sciweavers

BIBE
2005
IEEE
124views Bioinformatics» more  BIBE 2005»
13 years 10 months ago
Approximate Global Alignment of Sequences
We propose two novel dynamic programming (DP) methods that solve the the approximate bounded and unbounded global alignment problems for biological sequences. Our first method so...
Tamer Kahveci, Venkatakrishnan Ramaswamy, Han Tao,...