Hi Brett,
the k-Parameter specifies the band width around seeds given by the passed seed chain. This is compliant to the banded chain alignment algorithm described in the LAGAN paper.
So instead of taking the seed as is, one can compute a banded DP around the seed to find the optimal trace into and out of the seed.
My best guess, in your example is, that the entire alignment matrix is to small for a band extension of 15.
Nevertheless it should work, but maybe this is an uncovered border case. Can you please supply the seed chain?
It shouldn’t be to much on these small sequences?
Cheers,
René
---
René Rahn
Ph.D. Student
--------------------------------
Institute of Computer Science
Algorithmic Bioinformatics (ABI)
--------------------------------
Freie Universität Berlin
Takustraße 9
14195 Berlin
--------------------------------
|