English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 Local TagsRelease HistoryDetailsSummary
  Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences

Bannai, H., Tomohiro, I., Kociumaka, T., Koeppl, D., & Puglisi, S. J. (2023). Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica. doi:10.1007/s00453-023-01125-z.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-000D-3FF3-B Version Permalink: https://hdl.handle.net/21.11116/0000-000D-3FF4-A
Genre: Journal Article
Latex : Computing Longest {Lyndon} Subsequences and Longest Common {Lyndon} Subsequences

Files

show Files
hide Files
:
s00453-023-01125-z.pdf (Publisher version), 630KB
View   Save
File Permalink:
https://hdl.handle.net/21.11116/0000-000D-3FF5-9
Name:
s00453-023-01125-z.pdf
Description:
-
OA-Status:
Hybrid
Visibility:
Public
MIME-Type / Checksum:
application/pdf / [MD5]
Technical Metadata:
View
Copyright Date:
-
Copyright Info:
-
License:
-

Locators

show

Creators

show
hide
 Creators:
Bannai, Hideo1, Author
Tomohiro, I.1, Author
Kociumaka, Tomasz2, Author           
Koeppl, Dominik1, Author
Puglisi, Simon J.1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2023
 Publication Status: Published online
 Pages: 22 p.
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Bannai23
DOI: 10.1007/s00453-023-01125-z
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: New York, NY : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: - Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793