Finding maximum sum segments in sequences with uncertainty (Q2216439): Difference between revisions

@@ Property / author @@
-Der-Tsai Lee
@@ Property / author: Der-Tsai Lee / rank @@
-Normal rank
@@ Property / author @@
+Der-Tsai Lee
@@ Property / author: Der-Tsai Lee / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2020.11.005
+Normal rank
@@ Property / OpenAlex ID @@
+W3105863903
@@ Property / OpenAlex ID: W3105863903 / rank @@
+Normal rank
@@ Property / cites work @@
+Lowest common ancestors in trees and directed acyclic graphs
+Normal rank
@@ Property / cites work @@
+Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for locating the length-constrained heaviest segments with applications to biomolecular sequence analysis.
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2216439