New applications of interval generators to genome comparison (Q414431): Difference between revisions

@@ Property / DOI @@
-.1016/j.jda.2011.11.002
@@ Property / DOI: 10.1016/j.jda.2011.11.002 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.jda.2011.11.002
+Normal rank
@@ Property / OpenAlex ID @@
+W2000949547
@@ Property / OpenAlex ID: W2000949547 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximability of Comparing Genomes with Duplicates
+Normal rank
@@ Property / cites work @@
+Computing Common Intervals of <i>K</i> Permutations, with Applications to Modular Decomposition of Graphs
+Normal rank
@@ Property / cites work @@
+Q3393448
@@ Property / cites work: Q3393448 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Pattern Matching
@@ Property / cites work: Combinatorial Pattern Matching / rank @@
+Normal rank
@@ Property / cites work @@
+Fast algorithms to enumerate all common intervals of two permutations
+Normal rank
@@ Property / DOI @@
+.1016/J.JDA.2011.11.002
@@ Property / DOI: 10.1016/J.JDA.2011.11.002 / rank @@
+Normal rank