{"@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/Q417983","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q417983","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q417983","kernelVersion":"v1","immutable":true,"modified":"2026-01-18T09:38:07Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q417983","name":"Quasi-distinct parsing and optimal compression methods","headline":"Quasi-distinct parsing and optimal compression methods","description":"scientific article; zbMATH DE number 6034849","url":"https://portal.mardi4nfdi.de/entity/Q417983","datePublished":"2012-05-14","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q287044"},{"@id":"https://portal.mardi4nfdi.de/entity/Q208758"},{"@id":"https://portal.mardi4nfdi.de/entity/Q417981"},{"@id":"https://portal.mardi4nfdi.de/entity/Q417982"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q123643"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/J.TCS.2011.11.022","url":"https://doi.org/10.1016/J.TCS.2011.11.022"},"sameAs":["https://doi.org/10.1016/J.TCS.2011.11.022"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5506324"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4023085"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4503585"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4105595"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3196619"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3472037"},{"@id":"https://portal.mardi4nfdi.de/entity/Q3206858"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4975829"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4158937"},{"@id":"https://portal.mardi4nfdi.de/entity/Q4174617"}]},"provenance":{"prov:generatedAtTime":"2026-01-18T09:38:07Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}