The parameterized complexity of sequence alignment and consensus (Q1367540): Difference between revisions

@@ Property / cites work @@
+Searching subsequences
@@ Property / cites work: Searching subsequences / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+Normal rank
@@ Property / cites work @@
+Q4395000
@@ Property / cites work: Q4395000 / rank @@
+Normal rank
@@ Property / cites work @@
+The computation of consensus patterns in \(DNA\) sequences
+Normal rank
@@ Property / cites work @@
+Q4501141
@@ Property / cites work: Q4501141 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient methods for multiple sequence alignment with guaranteed error bounds
+Normal rank
@@ Property / cites work @@
+A Sentence-to-Sentence Clustering Procedure for Pattern Analysis
+Normal rank
@@ Property / cites work @@
+The Complexity of Some Problems on Subsequences and Supersequences
+Normal rank
@@ Property / cites work @@
+Multiple Alignment, Communication Cost, and Graph Matching
+Normal rank
@@ Property / cites work @@
+Matching Sequences under Deletion/Insertion Constraints
+Normal rank
@@ Property / cites work @@
+Simultaneous Solution of the RNA Folding, Alignment and Protosequence Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0304-3975(94)00251-d
+Normal rank
@@ Property / OpenAlex ID @@
+W2115667895
@@ Property / OpenAlex ID: W2115667895 / rank @@
+Normal rank