{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q299053","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q299053","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q299053","kernelVersion":"v1","immutable":true,"modified":"2026-03-23T13:53:17Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q299053","name":"Repetition-free longest common subsequence of random sequences","headline":"Repetition-free longest common subsequence of random sequences","description":"scientific article; zbMATH DE number 6596247","url":"https://portal.mardi4nfdi.de/entity/Q299053","datePublished":"2016-06-22","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q299052"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1261470"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q96294"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.DAM.2015.07.005","url":"https://doi.org/10.1016/J.DAM.2015.07.005"},"sameAs":["https://doi.org/10.1016/J.DAM.2015.07.005"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5901069"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3627965"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4257713"},{"@id":"https://portal.mardi4nfdi.de/entity/Q413298"},{"@id":"https://portal.mardi4nfdi.de/entity/Q407588"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2450749"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3419599"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2712576"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5538132"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2883608"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2573406"}]},"provenance":{"prov:generatedAtTime":"2026-03-23T13:53:17Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}