„Longest run subsequence problem“

Suchergebnisse

6 Treffer

• Approximability of Longest Run Subsequence and Complementary Minimization Problems
  Asahiro, Yuichi ; Gong, Mingyang ; Jansson, Jesper ; Lin, Guohui ; Lu, Sichen ; Miyano, Eiji ; Ono, Hirotaka ; Saitoh, Toshiki ; Tanaka, Shunichi 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Using the longest run subsequence problem within homology-based scaffolding
  Schrinner, Sven ; Goel, Manish ; Wulfert, Michael ; Spohr, Philipp ; Schneeberger, Korbinian ; Klau, Gunnar
• Approximation Algorithms for the Longest Run Subsequence Problem
  Asahiro, Yuichi ; Eto, Hiroshi ; Gong, Mingyang ; Jansson, Jesper ; Lin, Guohui ; Miyano, Eiji ; Ono, Hirotaka ; Tanaka, Shunichi 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Longest Run Subsequence Problem: Further Complexity Results
  Dondi, Riccardo ; Sikora, Florian 2021 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• The Longest Run Subsequence Problem
  Schrinner, Sven ; Goel, Manish ; Wulfert, Michael ; Spohr, Philipp ; Schneeberger, Korbinian ; Klau, Gunnar 2020 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Solving Some Sequence Problems on Run-Length Encoded Strings – Longest Common Subsequences, Edit Distances, and Squares
  Wang, Y. L. ; Huang, G. S. ; Liu, Jia-Jie 2008 VDM Verlag Dr. Müller