Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem (2009)
- Authors:
- Autor USP: FERREIRA, CARLOS EDUARDO - IME
- Unidade: IME
- DOI: 10.1504/IJBRA.2009.024034
- Subjects: BIOINFORMÁTICA; HEURÍSTICA; PROGRAMAÇÃO PARALELA
- Language: Inglês
- Imprenta:
- Publisher: Inderscience Publishers
- Publisher place: Geneva
- Date published: 2009
- Source:
- Título: International Journal of Bioinformatics Research and Applications
- ISSN: 1744-5485
- Volume/Número/Paginação/Ano: v. 5, n. 2, p. 163-177, 2009
- Este periódico é de assinatura
- Este artigo NÃO é de acesso aberto
- Cor do Acesso Aberto: closed
-
ABNT
VIANA, G.V.R. et al. Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem. International Journal of Bioinformatics Research and Applications, v. 5, n. 2, p. 163-177, 2009Tradução . . Disponível em: https://doi.org/10.1504/IJBRA.2009.024034. Acesso em: 27 dez. 2025. -
APA
Viana, G. V. R., Gomes, F. A. C., Ferreira, C. E., & Meneses, C. N. (2009). Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem. International Journal of Bioinformatics Research and Applications, 5( 2), 163-177. doi:10.1504/IJBRA.2009.024034 -
NLM
Viana GVR, Gomes FAC, Ferreira CE, Meneses CN. Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem [Internet]. International Journal of Bioinformatics Research and Applications. 2009 ; 5( 2): 163-177.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1504/IJBRA.2009.024034 -
Vancouver
Viana GVR, Gomes FAC, Ferreira CE, Meneses CN. Parallelisation of a multi-neighbourhood local search heuristic for a phylogeny problem [Internet]. International Journal of Bioinformatics Research and Applications. 2009 ; 5( 2): 163-177.[citado 2025 dez. 27 ] Available from: https://doi.org/10.1504/IJBRA.2009.024034 - 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
- Syntenic global alignment and its application to the gene prediction 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.1504/IJBRA.2009.024034 (Fonte: oaDOI API)
How to cite
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
