A sparse dynamic programming algorithm for alignment with non-overlapping inversions (2005)
- Authors:
- USP affiliated author: LAGO, ALAIR PEREIRA DO - IME
- School: IME
- DOI: 10.1051/ita:2005011
- Subject: SISTEMAS DE INFORMAÇÃO
- Agências de fomento:
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Rairo - Theoretical Informatics and Applications, Paris
- ISSN: 0988-3754
- Volume/Número/Paginação/Ano: v. 39, n. 1, p. 175-189, 2005
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: green
-
ABNT
LAGO, Alair Pereira do; MUCHNIK, I.; KULIKOWSKI, C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions. Rairo - Theoretical Informatics and Applications, Paris, Les Ulis, v. 39, n. 1, p. 175-189, 2005. Disponível em: < https://doi.org/10.1051/ita:2005011 > DOI: 10.1051/ita:2005011. -
APA
Lago, A. P. do, Muchnik, I., & Kulikowski, C. (2005). A sparse dynamic programming algorithm for alignment with non-overlapping inversions. Rairo - Theoretical Informatics and Applications, Paris, 39( 1), 175-189. doi:10.1051/ita:2005011 -
NLM
Lago AP do, Muchnik I, Kulikowski C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 175-189.Available from: https://doi.org/10.1051/ita:2005011 -
Vancouver
Lago AP do, Muchnik I, Kulikowski C. A sparse dynamic programming algorithm for alignment with non-overlapping inversions [Internet]. Rairo - Theoretical Informatics and Applications, Paris. 2005 ; 39( 1): 175-189.Available from: https://doi.org/10.1051/ita:2005011 - Sobre os semigrupos de burnside 'X POT.N'='X POT.N+M'
- Lossless filter for multiple repetitions with Hamming distance
- On the Burnside semigroups 'x POT.n' ='x POT.n+m'
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Local groups in free groupoids satisfying certain monoid identities
- A new algorithm for sparse suffix trees
- Stable two-sided matching of slot allocation in airport collaborative decision making
- Comparison with parametric optimization in credit card fraud detection
- On the Burnside semigroups xn = xn+m
- Maximal groups in free Burnside semigroups
Informações sobre o DOI: 10.1051/ita:2005011 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
