Syntenic global alignment and its application to the gene prediction problem (2013)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1007/s13173-013-0115-9
- Subjects: BIOLOGIA; GENÉTICA; PESQUISA OPERACIONAL; PROGRAMAÇÃO MATEMÁTICA; PROGRAMAÇÃO DINÂMICA
- Keywords: Sequences alignment; Dynamic programming; Gene prediction
- Language: Inglês
- Source:
- Título: Journal of the Brazilian Computer Society
- ISSN: 0104-6500
- Volume/Número/Paginação/Ano: v. 19, n. 4, p. 511-521, 2013
- Este periódico é de assinatura
- Este artigo é de acesso aberto
- URL de acesso aberto
- Cor do Acesso Aberto: hybrid
- Licença: cc-by
-
ABNT
ADI, Said Sadique e FERREIRA, Carlos Eduardo. Syntenic global alignment and its application to the gene prediction problem. Journal of the Brazilian Computer Society, v. 19, n. 4, p. 511-521, 2013Tradução . . Disponível em: https://doi.org/10.1007/s13173-013-0115-9. Acesso em: 27 dez. 2025. -
APA
Adi, S. S., & Ferreira, C. E. (2013). Syntenic global alignment and its application to the gene prediction problem. Journal of the Brazilian Computer Society, 19( 4), 511-521. doi:10.1007/s13173-013-0115-9 -
NLM
Adi SS, Ferreira CE. Syntenic global alignment and its application to the gene prediction problem [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19( 4): 511-521.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/s13173-013-0115-9 -
Vancouver
Adi SS, Ferreira CE. Syntenic global alignment and its application to the gene prediction problem [Internet]. Journal of the Brazilian Computer Society. 2013 ; 19( 4): 511-521.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1007/s13173-013-0115-9 - A PTAS for the metric case of the minimum sum-requirement communication spanning tree problem
- A PTAS for the metric case of the optimum weighted source–destination communication spanning tree problem
- Some formulations for the group Steiner tree problem
- Decomposing matrices into blocks
- Some integer programs arising in the design of main frame computers
- PTAS’s for some metric p-source communication spanning tree problems
- Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem
- The node capacitated graph pertitioning problem: a computational study
- The biclique k-clustering problem in bipartite graphs and its application in bioinformatics
- A dynamic programming algorithm for the tree mapping problem
Informações sobre o DOI: 10.1007/s13173-013-0115-9 (Fonte: oaDOI API)
Download do texto completo
| Tipo | Nome | Link | |
|---|---|---|---|
 |
2848043.pdf | Direct link |
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
