SimSearch: A new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequences
In this paper, we propose SimSearch, an algorithm implementing a new variant of dynamic programming based on distance series for optimal and near-optimal similarity discovery in biological sequences. The initial phase of SimSearch is devoted to fulfil the binary similarity matrices by signalling the...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | bookPart |
| Idioma: | eng |
| Publicado em: |
2011
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10198/4385 |
| País: | Portugal |
| Oai: | oai:bibliotecadigital.ipb.pt:10198/4385 |