{"@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/Q290231","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q290231","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q290231","kernelVersion":"v1","immutable":true,"modified":"2026-01-22T22:35:27Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q290231","name":"An \\(O(n\\log n)\\) algorithm for finding dissimilar strings","headline":"An \\(O(n\\log n)\\) algorithm for finding dissimilar strings","description":"scientific article; zbMATH DE number 6588301","url":"https://portal.mardi4nfdi.de/entity/Q290231","datePublished":"2016-06-01","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q290229"},{"@id":"https://portal.mardi4nfdi.de/entity/Q540551"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q63092"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/S0020-0190(97)00057-4","url":"https://doi.org/10.1016/S0020-0190(97)00057-4"},"sameAs":["https://doi.org/10.1016/S0020-0190(97)00057-4"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q4004078"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3986105"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3208702"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4074927"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5248496"}]},"provenance":{"prov:generatedAtTime":"2026-01-22T22:35:27Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}