A simple and space-efficient fragment-chaining algorithm for alignment of DNA and protein sequences (Q1861731): Difference between revisions

@@ Property / describes a project that uses @@
+DIALIGN
@@ Property / describes a project that uses: DIALIGN / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+Balibase
@@ Property / describes a project that uses: Balibase / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+GABIOS-LIB
@@ Property / describes a project that uses: GABIOS-LIB / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Multiple DNA and protein sequence alignment based on segment-to-segment comparison.
+Normal rank
@@ Property / cites work @@
+Q4532058
@@ Property / cites work: Q4532058 / rank @@
+Normal rank
@@ Property / cites work @@
+A polyhedral approach to sequence alignment problems
+Normal rank
@@ Property / cites work @@
+Linear-space algorithms that build local alignments from fragments
+Normal rank
@@ Property / cites work @@
+Sparse dynamic programming I
@@ Property / cites work: Sparse dynamic programming I / rank @@
+Normal rank
@@ Property / cites work @@
+A linear space algorithm for computing maximal common subsequences
+Normal rank
@@ Property / Wikidata QID @@
+Q127740538
@@ Property / Wikidata QID: Q127740538 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1861731