Linear-time algorithms for computing maximum-density sequence segments with bioinformatics applications (Q1776373): Difference between revisions

@@ Property / DOI @@
-.1016/j.jcss.2004.08.001
@@ Property / DOI: 10.1016/j.jcss.2004.08.001 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+cs/0207026
@@ Property / arXiv ID: cs/0207026 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms - ESA 2003
@@ Property / cites work: Algorithms - ESA 2003 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4410125
@@ Property / cites work: Q4410125 / rank @@
+Normal rank
@@ Property / cites work @@
+Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences
+Normal rank
@@ Property / cites work @@
+Linear-time algorithm for finding a maximum-density segment of a sequence
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
+Normal rank
@@ Property / cites work @@
+Pattern recognition in genetic sequences by mismatch density
+Normal rank
@@ Property / DOI @@
+.1016/J.JCSS.2004.08.001
@@ Property / DOI: 10.1016/J.JCSS.2004.08.001 / rank @@
+Normal rank