Lossless filter for multiple repeats with bounded edit distance (2009)
- Authors:
- USP affiliated author: LAGO, ALAIR PEREIRA DO - IME
- School: IME
- DOI: 10.1186/1748-7188-4-3
- Subject: ALGORITMOS GENÉTICOS
- Language: Inglês
- Imprenta:
- Source:
- Título do periódico: Algorithms for Molecular Biology
- ISSN: 1748-7188
- Volume/Número/Paginação/Ano: v. 4, p. 1-20, 2009
- Este periódico é de acesso aberto
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: gold
- Licença: cc-by
-
ABNT
PETERLONGO, Pierre; SACOMOTO, Gustavo Akio Tominaga; LAGO, Alair Pereira do; PISANTI, Nadia; SAGOT, Marie-France. Lossless filter for multiple repeats with bounded edit distance. Algorithms for Molecular Biology, Rennes, v. 4, p. 1-20, 2009. Disponível em: < https://doi.org/10.1186/1748-7188-4-3 > DOI: 10.1186/1748-7188-4-3. -
APA
Peterlongo, P., Sacomoto, G. A. T., Lago, A. P. do, Pisanti, N., & Sagot, M. -F. (2009). Lossless filter for multiple repeats with bounded edit distance. Algorithms for Molecular Biology, 4, 1-20. doi:10.1186/1748-7188-4-3 -
NLM
Peterlongo P, Sacomoto GAT, Lago AP do, Pisanti N, Sagot M-F. Lossless filter for multiple repeats with bounded edit distance [Internet]. Algorithms for Molecular Biology. 2009 ; 4 1-20.Available from: https://doi.org/10.1186/1748-7188-4-3 -
Vancouver
Peterlongo P, Sacomoto GAT, Lago AP do, Pisanti N, Sagot M-F. Lossless filter for multiple repeats with bounded edit distance [Internet]. Algorithms for Molecular Biology. 2009 ; 4 1-20.Available from: https://doi.org/10.1186/1748-7188-4-3 - 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 sparse dynamic programming algorithm for alignment with non-overlapping inversions
- 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
Informações sobre o DOI: 10.1186/1748-7188-4-3 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas