Fixed-parameter algorithms for scaffold filling (Q2513609): Difference between revisions

@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+Probably optimal graph motifs
@@ Property / cites work: Probably optimal graph motifs / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of the repetition free longest common subsequence problem
+Normal rank
@@ Property / cites work @@
+Variants of constrained longest common subsequence
+Normal rank
@@ Property / cites work @@
+On the approximability of the exemplar adjacency number problem for genomes with gene repetitions
+Normal rank
@@ Property / cites work @@
+Complexity issues in vertex-colored graph pattern matching
+Normal rank
@@ Property / cites work @@
+Finding approximate and constrained motifs in graphs
+Normal rank
@@ Property / cites work @@
+Q4393480
@@ Property / cites work: Q4393480 / rank @@
+Normal rank
@@ Property / cites work @@
+Upper and lower bounds for finding connected motifs in vertex-colored graphs
+Normal rank
@@ Property / cites work @@
+Q3393448
@@ Property / cites work: Q3393448 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding and counting vertex-colored subtrees
@@ Property / cites work: Finding and counting vertex-colored subtrees / rank @@
+Normal rank
@@ Property / cites work @@
+An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank