Estendendo a Teoria de Bafna e Pevzner para o Problema da Ordenação por Transposições
Abstract
Full Text:
PDF (Português (Brasil))References
[1] V. Bafna and P. Pevzner, Sorting by transpositions, SIAM Journal on Discrete Mathematics, 11, No. 2, (1998), 224-240.
D.A. Christie, “Genome Rearrangements Problems”, PhD thesis, Glasgow University, Scotland, 1998.
S.A. Guyer, L.S. Heath and J.P.C. Vergara, Subsequences and run heuristics for sorting by transpositions, in “4th Dimacs International Algorithm Implementation Challenge”, 1995.
R.W. Irving and D.A. Christie, Sorting permutations by block interchanges, Information Processing Letters, 60 (1996), 165-169.
J. Meidanis, M.E.M.T. Walter and Z. Dias, Transposition distance between a permutation and its reverse, in “Anais do IV South American workshop on string processing - WSP’97” (R. Balza Yates, ed.), pp. 70-79, Carleton University Press, Valparaiso, Chile, 1997.
E.T.G. Oliveira, “Implementação de Algoritmos para o Problema da Ordenação por Transposições”, Master’s thesis, Departamento de Ciência da Computação, Universidade de Brasília, 2001.
J.P. Vergara, “Sorting by Bounded Permutations”, PhD thesis, Virginia Polytechnic Institute and State University, 1997.
M.E.M.T. Walter, “Algoritmos para Problemas em Rearranjos de Genomas”, PhD thesis, Universidade de Campinas, 1999.
M.E.M.T. Walter, Z. Dias and J. Meidanis, A new approach for approximating the transposition distance, in “Proc. String Processing and Information Retrieval - SPIRE’2000”, pp. 199-208, 2000.
DOI: https://doi.org/10.5540/tema.2002.03.01.0213
Article Metrics
Metrics powered by PLOS ALM
Refbacks
- There are currently no refbacks.
Trends in Computational and Applied Mathematics
A publication of the Brazilian Society of Applied and Computational Mathematics (SBMAC)
Indexed in: