Zobrazeno 1 - 10
of 119
pro vyhledávání: '"Adorna, Henry"'
Autor:
Adorna, Henry N.
Several studies have been reported in the literature about SN P system and its variants. Often, the results provide universality of various variants and the classes of languages that these variants generate and recognize. The state of SN P system is
Externí odkaz:
http://arxiv.org/abs/2211.15159
Autor:
Adorna, Henry N.
In the 2010, matrix representation of SN P system without delay was presented while in the case of SN P systems with delay, matrix representation was suggested in the 2017. These representations brought about series of simulation of SN P systems usin
Externí odkaz:
http://arxiv.org/abs/2211.15156
Publikováno v:
In Theoretical Computer Science 4 January 2024 981
Autor:
Gungon, Rogelio V., Hernandez, Katreen Kyle M., Cabarle, Francis George C., de la Cruz, Ren Tristan A., Adorna, Henry N., Martínez-del-Amor, Miguel Á., Orellana-Martín, David, Pérez-Hurtado, Ignacio
Publikováno v:
In Neurocomputing 7 September 2022 503:140-161
This study investigates whether reoptimization can help in solving the closest substring problem. We are dealing with the following reoptimization scenario. Suppose, we have an optimal l-length closest substring of a given set of sequences S. How can
Externí odkaz:
http://arxiv.org/abs/1703.06644
This paper presents a formal method for characterizing the potential outliers from the data signature projection of traffic data set using Non-Metric Multidimensional Scaling (nMDS) visualization. Previous work had only relied on visual inspection an
Externí odkaz:
http://arxiv.org/abs/1702.07501
Motif finding is one of the NP-complete problems in Computational Biology. Existing nondeterministic algorithms for motif finding do not guarantee the global optimality of results and are sensitive to initial parameters. To address this problem, the
Externí odkaz:
http://arxiv.org/abs/1605.06904
Publikováno v:
Philippine Computing Journal Vol 10 (2): 1- 7 (2015)
In this paper, we define the reoptimization variant of the closest substring problem (CSP) under sequence addition. We show that, even with the additional information we have about the problem instance, the problem of finding a closest substring is s
Externí odkaz:
http://arxiv.org/abs/1603.02457
Autor:
Labao, Alfonso B.1 alfonso.labao@upd.edu.ph, Adorna, Henry N.1
Publikováno v:
Philippine Journal of Science. Feb2023, Vol. 152 Issue 1, p125-140. 16p.