{"@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/Q477704","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q477704","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q477704","kernelVersion":"v1","immutable":true,"modified":"2026-01-21T01:26:17Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q477704","name":"A fast algorithm for order-preserving pattern matching","headline":"A fast algorithm for order-preserving pattern matching","description":"scientific article; zbMATH DE number 6378693","url":"https://portal.mardi4nfdi.de/entity/Q477704","datePublished":"2014-12-09","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q477702"},{"@id":"https://portal.mardi4nfdi.de/entity/Q294960"},{"@id":"https://portal.mardi4nfdi.de/entity/Q477703"},{"@id":"https://portal.mardi4nfdi.de/entity/Q1754030"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q63092"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.IPL.2014.10.018","url":"https://doi.org/10.1016/J.IPL.2014.10.018"},"sameAs":["https://doi.org/10.1016/J.IPL.2014.10.018"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2867128"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2437748"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3651735"},{"@id":"https://portal.mardi4nfdi.de/entity/Q396621"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3090391"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4369384"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3527211"},{"@id":"https://portal.mardi4nfdi.de/entity/Q925062"}]},"provenance":{"prov:generatedAtTime":"2026-01-21T01:26:17Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}