14 citations · 52 across the 22 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2022
Subsequences With Gap Constraints: Complexity Bounds for Matching and Analysis Problems
Joel D. Day, Maria Kosche, Florin Manea +1
We consider subsequences with gap constraints, i.e., length-k subsequences p that can be embedded into a string w such that the induced gaps (i.e., the factors of w between the pos…
cs.CC2010★ 6 cited
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
Jürgen Dassow, Florin Manea
Starting from the fact that complete Accepting Hybrid Networks of Evolutionary Processors allow much communication between the nodes and are far from network structures used in pra…