A fast algorithm for determining the best combination of local alignments to a query sequence
AUTOR(ES)
Conant, Gavin C
FONTE
BioMed Central
ACESSO AO ARTIGO
http://www.pubmedcentral.nih.gov/articlerender.fcgi?artid=436051Documentos Relacionados
- An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
- A fast word search algorithm for the representation of sequence similarity in genomic DNA
- A fast word search algorithm for the representation of sequence similarity in genomic DNA.
- BALSA: Bayesian algorithm for local sequence alignment
- A fast algorithm for computing the Hartley/ Fourier spectrum