{"entities":{"Q1102756":{"pageid":1113508,"ns":120,"title":"Item:Q1102756","lastrevid":70097424,"modified":"2026-04-13T12:25:23Z","type":"item","id":"Q1102756","labels":{"en":{"language":"en","value":"A greedy approximation algorithm for constructing shortest common superstrings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 4051020"}},"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":"Q1102756$E0FF76F6-E478-47A5-8D8B-C1A9ED494AC3","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"57ed074beb45eeea265bd58658e5a7d7e9f10082","datavalue":{"value":{"text":"A greedy approximation algorithm for constructing shortest common superstrings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1102756$7E89E73B-E425-4AAD-8E5F-7B2F5C464E1C","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"c1ce0c937cf1a79c2ce58009fe830f30eff7b5e5","datavalue":{"value":"0644.68090","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1102756$F831A18F-51F1-4C3D-83FD-1F7B5B70153D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ba439e22522ec2e780a99ffc79a9c120d2352568","datavalue":{"value":"10.1016/0304-3975(88)90167-3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1102756$AA1001FF-2C64-4919-AAFA-EF8D7E92F0DD","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"d8d2d335ffbea0a5cfe9e309f2069474d0aade45","datavalue":{"value":{"entity-type":"item","numeric-id":414444,"id":"Q414444"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1102756$0E3AB1BE-10E5-46C1-A522-C88EBFF5ACA1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P16","hash":"9aa4172a39bf9ec948c8d6eb790fa409bd68117f","datavalue":{"value":{"entity-type":"item","numeric-id":294883,"id":"Q294883"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1102756$EE2AF28E-A15F-41D0-9697-72BAFC143134","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"f3c424cd94a60f9664f9fb69cc6027e75cc7ff3f","datavalue":{"value":{"entity-type":"item","numeric-id":123643,"id":"Q123643"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1102756$806233D2-7DF2-4822-9D46-2AD05B8C1C90","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"31a1937240ca4a323604b4728c31d242b5596d7c","datavalue":{"value":{"time":"+1988-00-00T00:00:00Z","timezone":0,"before":0,"after":0,"precision":9,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1102756$C85B4E13-7075-441E-ACBB-8CBDCD1ED913","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"272533d151ad7166ddac18470811a7220cea4b2c","datavalue":{"value":"An approximation algorithm for the shortest common superstring problem is developed, based on the Knuth-Pratt string-matching procedure and on the greedy heuristics for finding longest Hamiltonian paths\u00e9-game.","type":"string"},"datatype":"string"},"type":"statement","id":"Q1102756$E47CB534-EF14-46E0-901F-DCB648BC51A4","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"25fe30a6fe5285f54b3a7ea7d7e97ac0b640e4f9","datavalue":{"value":"68R99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1102756$DFFAA17D-E0A8-42AC-B90E-657188E5CA7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1102756$F599F3D4-5B22-4651-9FEA-0AD4CD73DECA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"8a784276b4e09d379c8147965411b455c3d79751","datavalue":{"value":"68T10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1102756$AE0BC39A-A756-4D5C-B694-6751471C201D","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"112b1123256ee2dfdd4f5e9b9bf4ab09f3c0243b","datavalue":{"value":"4051020","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1102756$117BA6C5-D76D-4B5F-A65B-0494B773E17E","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"15bdfeb034d9de89e2d634da0c0344efb658c732","datavalue":{"value":"shortest common superstring","type":"string"},"datatype":"string"},"type":"statement","id":"Q1102756$2069C8F0-6E23-47FF-A0B0-9E8A2C7FC34E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"12072cbc2a76f8add4b4511aa92986349ba9eb68","datavalue":{"value":"string-matching","type":"string"},"datatype":"string"},"type":"statement","id":"Q1102756$2B9DC008-0AB4-4AE3-AD0B-12978114472E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"a19db35eca4bde67027bee7de9947c8f7faae21e","datavalue":{"value":"greedy heuristics","type":"string"},"datatype":"string"},"type":"statement","id":"Q1102756$292163F9-436F-4B59-9CD7-0ED87134A02E","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":"Q1102756$42963F36-3A2F-42F7-800F-5ECE2EA5214C","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"e1a99b34b7dc6db961d8935de18f863fd0dac486","datavalue":{"value":"https://doi.org/10.1016/0304-3975(88)90167-3","type":"string"},"datatype":"url"},"type":"statement","id":"Q1102756$78351E0E-31DA-4A12-8341-707344DC4875","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"2d8b5947161297c5ca9f340be186c5e6546d65e6","datavalue":{"value":"W2090223576","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1102756$7AFD5F37-7F75-4848-BBA9-A6F3D04537A6","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"836ad2a04f82225da478ca9f694f5cd99360b315","datavalue":{"value":{"entity-type":"item","numeric-id":4198056,"id":"Q4198056"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1102756$CC2E3C32-A0BA-46CD-BF10-FE408EDFC7DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a4dd3523499f43d2fad563d29cef1a512ed9616d","datavalue":{"value":{"entity-type":"item","numeric-id":3865869,"id":"Q3865869"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1102756$4108069B-04E1-4B93-8E99-6C8B2D8AEB7F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"cac7f741f9b1e3426d597355d63b43bdf762c36a","datavalue":{"value":{"entity-type":"item","numeric-id":4148937,"id":"Q4148937"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1102756$7D91514F-0DFF-4AEE-96D5-5D280BD1F947","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"a6de23a87c1b476f1a39726dd60cb8a7c5a21b65","datavalue":{"value":{"entity-type":"item","numeric-id":3049828,"id":"Q3049828"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1102756$6BC4D088-7703-49D0-BBB9-F9E075B9C9FD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"A greedy approximation algorithm for constructing shortest common superstrings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/A_greedy_approximation_algorithm_for_constructing_shortest_common_superstrings"}}}}}