-
```
We need to be able to treat some edits as larger than others. Particularly
edits involving numbers are important.
```
Original issue reported on code.google.com by `lar...@gmail.com` on 1 Oct 20…
-
```
We need to be able to treat some edits as larger than others. Particularly
edits involving numbers are important.
```
Original issue reported on code.google.com by `lar...@gmail.com` on 1 Oct 20…
-
```
Currently support for both log-odds scoring and regular probability scores for
the Needleman-Wunsch alignment algorithm but there is no access to this support
from the command line utility.
```
…
-
```
The Needleman-Wunsch alignment algorithm currently uses a very hacky
convergence approach - just a series of iterations which have been
'heuristically' set. This should use a convergence criter…
-
```
Currently support for both log-odds scoring and regular probability scores for
the Needleman-Wunsch alignment algorithm but there is no access to this support
from the command line utility.
```
…
-
```
The Needleman-Wunsch alignment algorithm currently uses a very hacky
convergence approach - just a series of iterations which have been
'heuristically' set. This should use a convergence criter…
-
As commented in #204 the implementation of the (linear space) Guan-Uberbacher algorithm doesn't look to be linear in memory usage.
Both `org.biojava3.alignment.NeedlemanWunsch` and `org.biojava3.ali…
-
```
Currently support for both log-odds scoring and regular probability scores for
the Needleman-Wunsch alignment algorithm but there is no access to this support
from the command line utility.
```
…
-
```
The Needleman-Wunsch alignment algorithm currently uses a very hacky
convergence approach - just a series of iterations which have been
'heuristically' set. This should use a convergence criter…
-
```
We need to be able to treat some edits as larger than others. Particularly
edits involving numbers are important.
```
Original issue reported on code.google.com by `lar...@gmail.com` on 1 Oct 20…