{"entities":{"Q1007643":{"pageid":1009491,"ns":120,"title":"Item:Q1007643","lastrevid":66660126,"modified":"2026-04-12T11:37:51Z","type":"item","id":"Q1007643","labels":{"en":{"language":"en","value":"Linear-time algorithm for finding a maximum-density segment of a sequence"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 5530951"}},"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":"Q1007643$C411B587-950F-4A7C-8C4D-ADD0BF2A7644","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"aec981d5381d346ebe99afdc8432b2e510c4de59","datavalue":{"value":{"text":"Linear-time algorithm for finding a maximum-density segment of a sequence","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1007643$42CE8D5C-50DE-4A76-B91D-BAC16E9EDC20","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"4e08ede4358a7244a2638bda330a9c9c27d742cc","datavalue":{"value":"1162.68809","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1007643$7170E15B-C752-472F-938B-1B1E8A70297D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"57365287a7b1cecf65ba0706ea398abd1f11502f","datavalue":{"value":"10.1016/S0020-0190(03)00225-4","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1007643$E0617F5E-B9EA-42FE-B6E9-E8747D259EF3","rank":"normal"}],"P16":[{"mainsnak":{"snaktype":"value","property":"P16","hash":"5f9c5084c27701c594be24859d040d39b8990417","datavalue":{"value":{"entity-type":"item","numeric-id":216326,"id":"Q216326"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1007643$E78AAA8C-5F62-43C2-A5F3-380ED1509F9D","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"52fa7d44b58d0511cb8993765bd916aef86052d8","datavalue":{"value":{"entity-type":"item","numeric-id":63092,"id":"Q63092"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1007643$90DBFAA7-6B9A-46F9-B82A-7DDD54115362","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"7f048b9b8a41b82f9765bf157ba4b1fd3be60b72","datavalue":{"value":{"time":"+2009-03-23T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1007643$F3049963-B584-4530-B79A-AF099795E2CA","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"79b3bc872b6637176b35f9e46ac855febbf884f5","datavalue":{"value":"68W05","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1007643$496AD5CF-6F3B-4A10-B2F4-F2D98FD17209","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"61f5e4db0e91212ef2106e3db512d71730a68751","datavalue":{"value":"68U99","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1007643$56F7A83B-AA71-4C15-8AE1-F8806138B5EB","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"6c589fecca4e2795e8f5bde64d1346bdfc7a79ab","datavalue":{"value":"5530951","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1007643$65218A4B-9E2C-48D0-BEEB-028482532862","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"d607627523840bd0bf4407097f29a3a99ef4a0a8","datavalue":{"value":"algorithms","type":"string"},"datatype":"string"},"type":"statement","id":"Q1007643$37C3F7F3-6B8C-4CF3-BDE5-83C41054F020","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"387d3da80700813b0b7691a140fd19c167fc00b3","datavalue":{"value":"bioinformatics","type":"string"},"datatype":"string"},"type":"statement","id":"Q1007643$4734A190-4230-4AF5-870A-6215BF4944EC","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":"Q1007643$FCD6ECBB-7A91-4F57-8719-032906E43A0A","rank":"normal"}],"P223":[{"mainsnak":{"snaktype":"value","property":"P223","hash":"2674a2c6e950decd18e056288fc3928da6b5addb","datavalue":{"value":{"entity-type":"item","numeric-id":4410125,"id":"Q4410125"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1007643$5FC5B431-AFC3-46B5-8DDB-7B4D70C88779","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"ce61e6b922e9ea5c222691332d6284104c865c81","datavalue":{"value":{"entity-type":"item","numeric-id":4708595,"id":"Q4708595"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1007643$FB8C8F6D-2B75-4D0F-9967-79CF16966DBB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P223","hash":"694910451200ab7067ebbccacf142af3ac2a2369","datavalue":{"value":{"entity-type":"item","numeric-id":3992847,"id":"Q3992847"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1007643$548CBEF3-1236-4A76-AA85-28BBF4185F7B","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"7aac835864e67fccb5e0587871df7b70979765a0","datavalue":{"value":"https://doi.org/10.1016/s0020-0190(03)00225-4","type":"string"},"datatype":"url"},"type":"statement","id":"Q1007643$59A1895E-3454-4517-874D-E1576378BE0D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"ac014a2b8801b5a0d9ffcfc83cd35d2f9074fffe","datavalue":{"value":"W2051656366","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1007643$5C008BC3-B8D7-4D09-9483-51CFD0C0BB92","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Linear-time algorithm for finding a maximum-density segment of a sequence","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Linear-time_algorithm_for_finding_a_maximum-density_segment_of_a_sequence"}}}}}