| dc.creator | Lintzmayer C.N. | |
| dc.creator | Dias Z. | |
| dc.date | 2014 | |
| dc.date | 2015-06-25T18:03:15Z | |
| dc.date | 2015-11-26T15:05:43Z | |
| dc.date | 2015-06-25T18:03:15Z | |
| dc.date | 2015-11-26T15:05:43Z | |
| dc.date.accessioned | 2018-03-28T22:16:19Z | |
| dc.date.available | 2018-03-28T22:16:19Z | |
| dc.identifier | 9783642544224 | |
| dc.identifier | Lecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). Springer Verlag, v. 8392 LNCS, n. , p. 671 - 682, 2014. | |
| dc.identifier | 3029743 | |
| dc.identifier | 10.1007/978-3-642-54423-1_58 | |
| dc.identifier | http://www.scopus.com/inward/record.url?eid=2-s2.0-84899912958&partnerID=40&md5=bffcc19a25bcc4b8fdec69268abc303c | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/88013 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/88013 | |
| dc.identifier | 2-s2.0-84899912958 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1257098 | |
| dc.description | Reversals and transpositions are the most common kinds of genome rearrangements, which allow us to establish the divergence between individuals along evolution. When the rearrangements affect segments from the beginning or from the end of the genome, we say they are prefix or suffix rearrangements, respectively. This paper presents the first approximation algorithms for the problems of Sorting by Prefix Reversals and Suffix Reversals, Sorting by Prefix Transpositions and Suffix Transpositions and Sorting by Prefix Reversals, Prefix Transpositions, Suffix Reversals and Suffix Transpositions, all of them with factor 2. We also present the intermediary algorithms that lead us to the main results. © 2014 Springer-Verlag Berlin Heidelberg. | |
| dc.description | 8392 LNCS | |
| dc.description | | |
| dc.description | 671 | |
| dc.description | 682 | |
| dc.description | Agencia Nacional de Investigacion e Innovacion (ANII),Centro Latinoamericano de Estudios en Informatica (CLEI),et al.,Google,Universidad de la Republica, CSIC,Yahoo! Labs | |
| dc.description | Bafna, V., Pevzner, P.A., Genome rearrangements and sorting by reversals (1993) Proceedings of the 34th Annual Symposium on Foundations of Computer Science FOCS 1993, pp. 148-157 | |
| dc.description | Bafna, V., Pevzner, P.A., Sorting by transpositions (1998) SIAM Journal on Discrete Mathematics, 11 (2), pp. 224-240 | |
| dc.description | Berman, P., Hannenhalli, S., Karpinski, M., 1.375-approximation algorithm for sorting by reversals (2002) ESA 2002. LNCS, 2461, pp. 200-210. , Möhring, R.H., Raman, R. (eds.) Springer, Heidelberg | |
| dc.description | Bulteau, L., Fertin, G., Rusu, I., Pancake flipping is hard (2012) MFCS 2012. LNCS, 7464, pp. 247-258. , Rovan, B., Sassone, V., Widmayer, P. (eds.) Springer, Heidelberg | |
| dc.description | Bulteau, L., Fertin, G., Rusu, I., Sorting by transpositions is difficult (2012) SIAM Journal on Computing, 26 (3), pp. 1148-1180 | |
| dc.description | Caprara, A., Sorting permutations by reversals and eulerian cycle decompositions (1999) SIAM Journal on Discrete Mathematics, 12 (1), pp. 91-110 | |
| dc.description | Dias, Z., Meidanis, J., Sorting by prefix transpositions (2002) SPIRE 2002. LNCS, 2476, pp. 65-76. , Laender, A.H.F., Oliveira, A.L. (eds.) Springer, Heidelberg | |
| dc.description | Elias, I., Hartman, T., A 1.375-approximation algorithm for sorting by transpositions (2006) IEEE/ACM Transactions on Computational Biology and Bioinformatics, 3 (4), pp. 369-379 | |
| dc.description | Fischer, J., Ginzinger, S.W., A 2-approximation algorithm for sorting by prefix reversals (2005) ESA 2005. LNCS, 3669, pp. 415-425. , Brodal, G.S., Leonardi, S. (eds.) Springer, Heidelberg | |
| dc.description | Galvão, G.R., Dias, Z., On the performance of sorting permutations by prefix operations (2012) Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB 2012), pp. 102-107. , Las Vegas, Nevada, USA | |
| dc.description | Sharmin, M., Yeasmin, R., Hasan, M., Rahman, A., Rahman, M.S., Pancake flipping with two spatulas (2010) Electronic Notes in Discrete Mathematics, 36, pp. 231-238. , International Symposium on Combinatorial Optimization ISCO 2010 | |
| dc.language | en | |
| dc.publisher | Springer Verlag | |
| dc.relation | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | |
| dc.rights | fechado | |
| dc.source | Scopus | |
| dc.title | Sorting Permutations By Prefix And Suffix Versions Of Reversals And Transpositions | |
| dc.type | Actas de congresos | |
