Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Yoan José Pinzón Ardila"'
Publikováno v:
Revista Colombiana de Computación, Vol 10, Iss 1 (2009)
In this paper, a novel method for image encryption based on a Generalized Chinese Remainder Theorem (GCRT) is presented. The proposed method is based on the work developed by Jagannathan et al. Some modifications are proposed in order to increase the
Externí odkaz:
https://doaj.org/article/d20438c7f6a44b7cbc60d683b5f8ae2e
Autor:
Gad M. Landau, Manal Mohamed, Costas S. Iliopoulos, Raphaël Clifford, Yoan José Pinzón Ardila
Publikováno v:
International Journal of Computational Methods. :351-363
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances), let each sequence have the same number (k) of 1's. We are interested in computing the cyclic swap distance between A and B, i.e. the minimum number of swa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c7d096914e23cdcf6624b591dcca12bd
https://doi.org/10.1142/s0219876208001583
https://doi.org/10.1142/s0219876208001583
Autor:
Manolis Christodoulakis, Geoffrey Brian Golding, Yoan José Pinzón Ardila, Costas S. Iliopoulos, William F. Smyth
Publikováno v:
Journal of Computational Biology. 14:1001-1010
The number of segregating sites provides an indicator of the degree of DNA sequence variation that is present in a sample, and has been of great interest to the biological, pharmaceutical and medical professions. In this paper, we first provide linea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6e0341a4c02537a479770a1b644ad98
https://doi.org/10.1089/cmb.2006.0136
https://doi.org/10.1089/cmb.2006.0136
Autor:
David Camilo Becerra Romero, Sergio Duarte Torres, Yoan José Pinzón Ardila, Luis Fernando Niño Vasquez
Publikováno v:
GECCO
In this paper, a model based on genetic algorithms for protein folding prediction is proposed. The most important features of the proposed approach are: i) Heuristic secondary structure information is used in the initialization of the genetic algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cd0d4f1a68430310101c7e43a6e2a101
https://doi.org/10.1145/1276958.1277039
https://doi.org/10.1145/1276958.1277039
Publikováno v:
SOFSEM 2006: Theory and Practice of Computer Science ISBN: 9783540311980
SOFSEM
SOFSEM
In this paper we focus on the combinatorial properties of the Fibonacci strings rotations. We first present a simple formula that, in constant time, determines the rank of any rotation (of a given Fibonacci string) in the lexicographically-sorted lis
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f554690e42b6501f0299d1a51257c787
https://doi.org/10.1007/11611257_19
https://doi.org/10.1007/11611257_19
Autor:
Yoan José Pinzón Ardila, In-Bok Lee
Publikováno v:
String Processing and Information Retrieval ISBN: 9783540297406
SPIRE
SPIRE
Given a set of strings $\mathcal{U} = \{T_{1}, T_{2}, . . . , T_{\ell}\}$, the longest common repeat problem is to find the longest common substring that appears at least twice in each string of $\mathcal{U}$, considering direct, inverted, mirror as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff8f93288d079fc87ba66233e24014c5
https://doi.org/10.1007/11575832_21
https://doi.org/10.1007/11575832_21
Publikováno v:
String Processing and Information Retrieval ISBN: 9783540297406
SPIRE
SPIRE
Given two n-bit (cyclic) binary strings, A and B, represented on a circle (necklace instances). Let each sequence have the same number k of 1's. We are interested in computing the cyclic swap distance between A and B, i.e., the minimum number of swap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::39fd49fdbde3d3497bd4304693f2aa9a
https://doi.org/10.1007/11575832_27
https://doi.org/10.1007/11575832_27
Autor:
Yoan José Pinzon Ardila, Shu Wang
Publikováno v:
Revista Colombiana de Computación, Vol 10, Iss 1 (2009)
Recently, some pattern matching algorithms allowing gaps were introduced in Crochemore et al. [Approximate string matching with gaps. Nordic Journal of Computing, 9 (2002):54–65, 2002], where upper-bounded, strict-bounded and unbounded gaps were co
Externí odkaz:
https://doaj.org/article/3c4ab6129b1141a38e9091b3901f5855