3 citations · 5 across the 4 of their papers we have counts for
7 papers
Reoptimization of the Closest Substring Problem under Pattern Length Modification
Jhoirene B. Clemente, Henry N. Adorna
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 opt…
Characterizing Classes of Potential Outliers through Traffic Data Set Data Signature 2D nMDS Projection
Erlo Robert F. Oquendo, Jhoirene B. Clemente, Jasmine A. Malinao +1
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…
PROJECTION Algorithm for Motif Finding on GPUs
Jhoirene B. Clemente, Francis George C. Cabarle, Henry N. Adorna
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…
On Self-Reducibility and Reoptimization of Closest Substring Problem
Jeffrey Aborot, Henry Adorna, Jhoirene Clemente
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…
On The Delays In Spiking Neural P Systems
Francis George C. Cabarle, Kelvin C. Buño, Henry N. Adorna
In this work we extend and improve the results done in a previous work on simulating Spiking Neural P systems (SNP systems in short) with delays using SNP systems without delays. W…
Time After Time: Notes on Delays In Spiking Neural P Systems
Francis George C. Cabarle, Kelvin C. Buño, Henry N. Adorna
Spiking Neural P systems, SNP systems for short, are biologically inspired computing devices based on how neurons perform computations. SNP systems use only one type of symbol, the…