Abstract. The understanding of genome rearrangements is an important endeavor in comparative genomics. A major computational problem in this field is finding a shortest sequence of...
—We propose new algorithms for computing pairwise rearrangement scenarios that conserve the combinatorial structure of genomes. More precisely, we investigate the problem of sort...
— In modern wireless networks the functions included into layer II have to deal with complex problems, such as security and access control, that were previously demanded to upper...
A novel method for projecting points onto a point cloud, possibly with noise, is presented based on the point directed projection (DP) algorithm proposed by Azariadis P., Sapidis ...