{"entities":{"Q6622008":{"pageid":14233165,"ns":120,"title":"Item:Q6622008","lastrevid":103962659,"modified":"2026-06-06T08:33:07Z","type":"item","id":"Q6622008","labels":{"en":{"language":"en","value":"Faster algorithms for computing the hairpin completion distance and minimum ancestor"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7929268"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622008$19120B34-D6D6-471C-8579-ACBAD09B7524","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"96b6c381ee3889b932441836bc49645548b96495","datavalue":{"value":{"text":"Faster algorithms for computing the hairpin completion distance and minimum ancestor","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6622008$D1045183-BF5E-49DF-9A5D-75630A0DB454","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"ba4496df726deeafe7363f28088efe5d0b575935","datavalue":{"value":{"entity-type":"item","numeric-id":5075737,"id":"Q5075737"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622008$8935F831-1503-43B5-BD5C-681A58B58B39","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"2f59fc142daa122d0c6fd21e53a3189d1c8c0fad","datavalue":{"value":{"entity-type":"item","numeric-id":6575225,"id":"Q6575225"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622008$B051FF3E-8124-4D4B-8DA2-BCDED53A113D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"ee5271b4604a0d7297d4a60fc738faa2edaf414d","datavalue":{"value":{"entity-type":"item","numeric-id":6622007,"id":"Q6622007"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622008$ACFEC9BC-8411-4FF6-B663-C73C2FDF7506","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"395b8cd9be26def9a6018408d4b0a4540307477b","datavalue":{"value":{"entity-type":"item","numeric-id":2718249,"id":"Q2718249"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622008$6A502F30-80B9-4F04-89AE-C31E96AC1340","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"ac889730097a55c61339de7e6de152e6be5788f0","datavalue":{"value":{"time":"+2024-10-21T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6622008$F1C7DE23-3092-4940-8677-484913A7C6A0","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"824c9242ee6f86c15bf4eecb8cafeab39e222c2d","datavalue":{"value":"68W32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6622008$46DD2628-36E9-4AFE-A9AB-A5FDB287A559","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"11dbd7103f6be402c95b964fc9e88533f8d9c9ab","datavalue":{"value":"7929268","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6622008$A989172B-98E6-4133-A581-32594B96CCE1","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"0d82cfa81638332a8c825bcbbd9d7f7f9c0c45be","datavalue":{"value":"dynamic programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q6622008$D9DD389B-C46A-4D50-8506-05B6733B7EEE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"882d679657b839fd018b23fecb68a1059d92d2b3","datavalue":{"value":"incremental trees","type":"string"},"datatype":"string"},"type":"statement","id":"Q6622008$14BCC6F5-2F4D-4BE6-BF35-424B86CB1374","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"56c22d5775221423046cc5c67c2b493cdcf52842","datavalue":{"value":"exact algorithm","type":"string"},"datatype":"string"},"type":"statement","id":"Q6622008$8705E205-F8C1-4786-A667-0DEF6F6B248E","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6622008$6984ABC6-953E-4297-81D5-D7FBD084FBC1","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"f938ce00c7e959f9622794a6cd70f5786ecb9ae6","datavalue":{"value":"10.4230/LIPICS.CPM.2023.5","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6622008$A6627E6B-B40A-4CAF-8CF6-5C40797F612D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Faster algorithms for computing the hairpin completion distance and minimum ancestor","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Faster_algorithms_for_computing_the_hairpin_completion_distance_and_minimum_ancestor"}}}}}