Abstract. The multiple sequence alignment problem (MSA) can be reformulated as the problem of finding a maximum weight trace in an alignment graph, which is derived from all pairw...
We consider the problem of embroidering a design pattern, given by a graph G, using a single minimum length thread. We give an exact polynomial-time algorithm for the case that G ...
Esther M. Arkin, George Hart, Joondong Kim, Irina ...
Abstract— The inherent nature of the physical setup and transmission mechanism in wireless ad hoc networks with random channel access, results in correlation between the link met...
Arzad Alam Kherani, Dinesh Kumar 0002, Eitan Altma...
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
Abstract. We give a survey of algorithms for computing topological invariants of semi-algebraic sets with special emphasis on the more recent developments in designing algorithms f...