Multiple sequence alignment is an important and difficult problem in molecular biology and bioinformatics. In this paper, we propose a partitioning approach that significantly impr...
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...
Ant colony optimization (ACO) has been widely used for different combinatorial optimization problems. In this paper, we investigate ACO algorithms with respect to their runtime beh...
We discuss the situation where a curve C, defined over a number field K, has a known K-rational divisor class of degree 1, and consider whether this class contains an actual K-ra...
In this paper, we study p-divisibility of discriminants of Hecke algebras associated to spaces of cusp forms of prime level. By considering cusp forms of weight bigger than 2, we a...