Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource, 1 online resource.
- Sprache
-
Englisch
- Erschienen in
-
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences ; day:6 ; month:5 ; year:2023 ; pages:1-22
Algorithmica ; (6.5.2023), 1-22
- Urheber
-
Bannai, Hideo
I., Tomohiro
Kociumaka, Tomasz
Köppl, Dominik
Puglisi, Simon J.
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1007/s00453-023-01125-z
- URN
-
urn:nbn:de:101:1-2023090610370551625837
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:52 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bannai, Hideo
- I., Tomohiro
- Kociumaka, Tomasz
- Köppl, Dominik
- Puglisi, Simon J.
- SpringerLink (Online service)
Ähnliche Objekte (12)
Dynamic and Internal Longest Common Substring
The longest journey
Fast and Longest Rollercoasters
Women: the longest revolution
The longest Laminate Flooring
Publisher Correction: Longest Common Substring with Approximately k Mismatches
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Acceleration of sequence clustering using longest common subsequence filtering
Stein, Longest F. (1953) Galerist
Dominating and longest cycles in graphs
Mapping biological entities using the longest approximately common prefix method
Chapter LXVII. The longest and the last
Dynamic and Internal Longest Common Substring
The longest journey
Fast and Longest Rollercoasters
Women: the longest revolution
The longest Laminate Flooring
Publisher Correction: Longest Common Substring with Approximately k Mismatches
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Acceleration of sequence clustering using longest common subsequence filtering
Stein, Longest F. (1953) Galerist
Dominating and longest cycles in graphs
Mapping biological entities using the longest approximately common prefix method
Chapter LXVII. The longest and the last
Dynamic and Internal Longest Common Substring
The longest journey
Fast and Longest Rollercoasters
Women: the longest revolution
The longest Laminate Flooring
Publisher Correction: Longest Common Substring with Approximately k Mismatches
Tight Conditional Lower Bounds for Longest Common Increasing Subsequence
Acceleration of sequence clustering using longest common subsequence filtering
Stein, Longest F. (1953) Galerist
Dominating and longest cycles in graphs
Mapping biological entities using the longest approximately common prefix method