{"entities":{"Q6496832":{"pageid":14075605,"ns":120,"title":"Item:Q6496832","lastrevid":103421276,"modified":"2026-06-06T07:20:21Z","type":"item","id":"Q6496832","labels":{"en":{"language":"en","value":"An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 7842467"}},"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":"Q6496832$44012898-1222-4EF0-961F-7F0519F1D64B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"1809decee6a553afd43df5f63e5302b423a3435b","datavalue":{"value":{"text":"An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q6496832$DA7CA29D-D8F2-4502-B02D-65416C636B9B","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5cd90d1379d12c9a0d4ff615a1f80bc47193227c","datavalue":{"value":{"entity-type":"item","numeric-id":324802,"id":"Q324802"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6496832$9F5E3BFA-86A6-4570-BB4D-282B6B52EA35","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5f5c94127d5e6fdbb6a468f3b4a62cd3ab8a363e","datavalue":{"value":{"entity-type":"item","numeric-id":1283835,"id":"Q1283835"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6496832$7BD02EAC-ACC5-47A9-BF0D-EF41E848D74B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"5ae9ae3d803b6f9d7df2d14c483ee95b047535f8","datavalue":{"value":{"entity-type":"item","numeric-id":175575,"id":"Q175575"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6496832$C5401343-523B-4E34-BEB9-AC46F87CF77F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"b2b224aab66ffb4af458805268689af05df667de","datavalue":{"value":{"entity-type":"item","numeric-id":418169,"id":"Q418169"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q6496832$DFB8958A-B794-4E69-A311-19EED8B4FF60","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"14c7d324deceb0c23bfcf3623394d19aef3276a4","datavalue":{"value":{"time":"+2024-05-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q6496832$F3603908-AFBC-468A-BFD5-97319BF4DD70","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"824c9242ee6f86c15bf4eecb8cafeab39e222c2d","datavalue":{"value":"68W32","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6496832$38E8B126-0F51-4F65-A5A1-A7FDEB1378F1","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"bb146328b0c6862c8ac39d52471b7ee35514f5aa","datavalue":{"value":"7842467","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6496832$F2FDFB2E-8AEA-4841-B81B-DFE73C556AC8","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"3ba298f9e9747af315a29ef366fb5577203ec1ce","datavalue":{"value":"NP-hard string problems","type":"string"},"datatype":"string"},"type":"statement","id":"Q6496832$6A01F7B3-9CAD-4F1E-BFCF-8AE27C793A10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e904b6a2b63343426458be16881487ba173b5576","datavalue":{"value":"multiple sequence alignment","type":"string"},"datatype":"string"},"type":"statement","id":"Q6496832$FC544C74-D43B-4DF2-AFAD-8E866A24DA10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"7d2f2b811a8a66759e2bf089c54644e0adb049b4","datavalue":{"value":"center string","type":"string"},"datatype":"string"},"type":"statement","id":"Q6496832$64DA78FB-33D9-4DD0-8EDC-5965506DB46F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"ee63604621b6fd9d90b10f19ccdd9c167a66b1b6","datavalue":{"value":"parameterized complexity","type":"string"},"datatype":"string"},"type":"statement","id":"Q6496832$C6D2FEB0-CF00-4998-9EA9-C7788B2769A8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"72155bdb01364fa489e6c4c59109918b949f1952","datavalue":{"value":"search tree algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6496832$FACABC25-7AAA-4007-A902-C6136B615378","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6372377a72ec01e95be2eafa77fbfe774e76001c","datavalue":{"value":"enumerative algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q6496832$B8024D45-AF33-425F-9FCC-53A0EA0F52CD","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":"Q6496832$94F660A2-AA6E-454A-82DB-48FADF1205A3","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"00e1add3c4a49d24ff5b5d47c8096b44febcdf24","datavalue":{"value":"10.4230/LIPICS.CPM.2022.6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q6496832$9CE29BC7-4487-425D-BD2A-6FD10F5C04DB","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"An FPT-algorithm for longest common subsequence parameterized by the maximum number of deletions","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/An_FPT-algorithm_for_longest_common_subsequence_parameterized_by_the_maximum_number_of_deletions"}}}}}