Athanasios K. Tsakalidis

Learn More
In this paper we consider several new versions of approximate string matching with gaps. The main characteristic of these new versions is the existence of gaps in the matching of a given pattern in a text. Algorithms are sketched for each version and their time and space complexity is stated. The specific versions of approximate string matching have various(More)
The introduction of software development via Web Services has been the most significant web engineering paradigm, in the last years. The widely acknowledged importance of the Web Services’ concept lies in the fact that they provide a platform independent answer to the software component development question. Equally important are the mechanisms that allow(More)
In this paper we introduce the Weighted Suffix Tree, an efficient data structure for computing string regularities in weighted sequences of molecular data. Molecular Weighted Sequences can model important biological processes such as the DNA Assembly Process or the DNA-Protein Binding Process. Thus pattern matching or identification of repeated patterns, in(More)
We present simple algorithms for three problems belonging to the class of intersection query problems. The "rst algorithm deals with the static rectangle enclosure problem and can easily be extended to d dimensions, the second algorithm copes with the generalized c-oriented polygon intersection searching problem in two dimensions, while the third solves the(More)
The introduction of software development via Web Services has been the most significant web engineering paradigm, in the last years. The widely acknowledged importance of the Web Services’ concept lies in the fact that they provide a platform independent answer to the software component development question. Equally important are the mechanisms that allow(More)