Results 1  10
of
243,492
Minimum Common String Partition Parameterized by Partition Size is FixedParameter Tractable
"... Abstract. The NPhard Minimum Common String Partition problem asks whether two strings x and y can each be partitioned into at most k substrings, called blocks, such that both partitions use exactly the same blocks in a different order. We present the first fixedparameter algorithm for Minimum Comm ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. The NPhard Minimum Common String Partition problem asks whether two strings x and y can each be partitioned into at most k substrings, called blocks, such that both partitions use exactly the same blocks in a different order. We present the first fixedparameter algorithm for Minimum
Minimum Common String Partition Parameterized ⋆
"... Abstract. Minimum Common String Partition (MCSP) and related problems are of interest in, e.g., comparative genomics, DNA fingerprint assembly, and ortholog assignment. Given two strings with equal symbol content, the problem is to partition one string into k blocks, k as small as possible, and to p ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
, and to permute them so as to obtain the other string. MCSP is NPhard, and only approximation algorithms are known. Here we show that MCSP is fixedparameter tractable in suitable parameters, so that practical instances can be efficiently solved to optimality. 1 Parameterization of MCSP String z is called a
A FixedParameter Algorithm for Minimum Common String Partition with Few Duplications
"... Abstract. Motivated by the study of genome rearrangements, the NPhard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks. We consider an extension of this problem to unbalanced strings, so that some elements may not be covered by a ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. Motivated by the study of genome rearrangements, the NPhard Minimum Common String Partition problems asks, given two strings, to split both strings into an identical set of blocks. We consider an extension of this problem to unbalanced strings, so that some elements may not be covered
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1218 (75 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Fixedparameter
"... tractable canonization and isomorphism test for graphs of bounded treewidth∗ ..."
Abstract
 Add to MetaCart
tractable canonization and isomorphism test for graphs of bounded treewidth∗
Fixedparameter
"... tractable canonization and isomorphism test for graphs of bounded treewidth∗ ..."
Abstract
 Add to MetaCart
tractable canonization and isomorphism test for graphs of bounded treewidth∗
Chordal editing is fixedparameter tractable
 In 31st International Symposium on Theoretical Aspects of Computer Science
, 2014
"... Graph modification problems are typically asked as follows: is there a set of k operations that transforms a given graph to have a certain property. The most commonly considered operations include vertex deletion, edge deletion, and edge addition; for the same property, one can define significantly ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
edge deletions, and k3 edge additions. Clearly, this problem generalizes both chordal vertex/edge deletion and chordal completion (also known as minimum fillin). Our main result is an algorithm for chordal editing in time 2O(k log k) · nO(1), where k: = k1 + k2 + k3; therefore, the problem is fixedparameter
Scheduling Meets FixedParameter Tractability
"... Abstract. Fixedparameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixedparameter algorithms are appealing for many reasons, no such algorithms are known for ..."
Abstract
 Add to MetaCart
Abstract. Fixedparameter tractability analysis and scheduling are two core domains of combinatorial optimization which led to deep understanding of many important algorithmic questions. However, even though fixedparameter algorithms are appealing for many reasons, no such algorithms are known
Results 1  10
of
243,492