Fixed-Parameter Algorithms For Protein Similarity Search Under mRNA Structure Constraints

This scheme is proposed by [14] to design a subexponential fixed-parameter algorithm of Partial Vertex Cover with respect to k, which is also not a bidimensional problem,

The first problem we consider, called One-sided scaffold filling, given an incomplete genome B and a complete genome A, asks for the insertion of missing genes into an incomplete

The approx- imation algorithm is based on the observation that heterozygous columns in binary matrices naturally encode bipartitions of the fragments and that, by Property 2, if

The Domino problem is the following decision problem: given a finite set of Wang tiles, decide whether it admits a tiling.. Theorem 1

Key words: Algebraic varieties of general type — Rational maps — Canonical bundle and pluricanonical embeddings — Chern classes — Finiteness theorems of de Franchis - Severi type

Finally, if G F has entwined cycles (set of cycles with common edges), we have designed a deterministic fixed-parameter algorithm for #2SAT, that is, an algorithm whose time

Keywords: social network analysis, routing, facility location, matroid optimiza- tion, parameterized complexity, NP-hard problem. This lecture presents ongoing joint work with

NUMERICAL SIMULATION ON A FIXED MESH FOR THE FEEDBACK STABILIZATION OF A FLUID-STRUCTURE INTERACTION SYSTEM WITH A STRUCTURE GIVEN BY A FINITE NUMBER OF PARAMETERS.. IUTAM Symposium