Mostrar el registro sencillo del ítem
dc.contributor.author | Sempere Luna, José María | es_ES |
dc.date.accessioned | 2021-02-16T04:32:22Z | |
dc.date.available | 2021-02-16T04:32:22Z | |
dc.date.issued | 2020-01 | es_ES |
dc.identifier.issn | 0129-0541 | es_ES |
dc.identifier.uri | http://hdl.handle.net/10251/161386 | |
dc.description | Electronic version of an article published as International Journal of Foundations of Computer Science 2020 31:01, 133-142, DOI: 10.1142/S0129054120400092 © World Scientific Publishing Company https://www.worldscientific.com/worldscinet/ijfcs | es_ES |
dc.description.abstract | [EN] In this paper, we investigate the compensation loops, a DNA rearrangement in chromosomes due to unequal crossing over. We study the e fect of compensation loops over the gene duplication, and we formalize it as a restricted case of gene duplication in general. We study this biological process under the point of view of formal languages, and we provide some results about the languages de fined in this way. | es_ES |
dc.language | Inglés | es_ES |
dc.publisher | World Scientific | es_ES |
dc.relation.ispartof | International Journal of Foundations of Computer Science | es_ES |
dc.rights | Reserva de todos los derechos | es_ES |
dc.subject | DNA rearrangement | es_ES |
dc.subject | Duplication over strings | es_ES |
dc.subject | Formal languages | es_ES |
dc.subject | Regular expressions | es_ES |
dc.subject.classification | LENGUAJES Y SISTEMAS INFORMATICOS | es_ES |
dc.title | On Compensation Loops in Genomic Duplications | es_ES |
dc.type | Artículo | es_ES |
dc.identifier.doi | 10.1142/S0129054120400092 | es_ES |
dc.rights.accessRights | Abierto | es_ES |
dc.contributor.affiliation | Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació | es_ES |
dc.description.bibliographicCitation | Sempere Luna, JM. (2020). On Compensation Loops in Genomic Duplications. International Journal of Foundations of Computer Science. 31(1):133-142. https://doi.org/10.1142/S0129054120400092 | es_ES |
dc.description.accrualMethod | S | es_ES |
dc.relation.publisherversion | https://doi.org/10.1142/S0129054120400092 | es_ES |
dc.description.upvformatpinicio | 133 | es_ES |
dc.description.upvformatpfin | 142 | es_ES |
dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
dc.description.volume | 31 | es_ES |
dc.description.issue | 1 | es_ES |
dc.relation.pasarela | S\402031 | es_ES |
dc.description.references | Bovet, D. P., & Varricchio, S. (1992). On the regularity of languages on a binary alphabet generated by copying systems. Information Processing Letters, 44(3), 119-123. doi:10.1016/0020-0190(92)90050-6 | es_ES |
dc.description.references | Dassow, J., Mitrana, V., & Salomaa, A. (1997). Context-free evolutionary grammars and the structural language of nucleic acids. Biosystems, 43(3), 169-177. doi:10.1016/s0303-2647(97)00036-1 | es_ES |
dc.description.references | Ehrenfeucht, A., & Rozenberg, G. (1984). On regularity of languages generated by copying systems. Discrete Applied Mathematics, 8(3), 313-317. doi:10.1016/0166-218x(84)90129-x | es_ES |
dc.description.references | Leupold, P., Martín-Vide, C., & Mitrana, V. (2005). Uniformly bounded duplication languages. Discrete Applied Mathematics, 146(3), 301-310. doi:10.1016/j.dam.2004.10.003 | es_ES |
dc.description.references | Leupold, P., & Mitrana, V. (2007). Uniformly bounded duplication codes. RAIRO - Theoretical Informatics and Applications, 41(4), 411-424. doi:10.1051/ita:2007021 | es_ES |
dc.description.references | Leupold, P., Mitrana, V., & Sempere, J. M. (2003). Formal Languages Arising from Gene Repeated Duplication. Lecture Notes in Computer Science, 297-308. doi:10.1007/978-3-540-24635-0_22 | es_ES |
dc.description.references | Rozenberg, G., & Salomaa, A. (Eds.). (1997). Handbook of Formal Languages. doi:10.1007/978-3-642-59126-6 | es_ES |