{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T05:48:31Z","timestamp":1784180911903,"version":"3.55.0"},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"10","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003,7,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: Described is an algorithm to find the longest interval having at least a specified minimum bias in a sequence of characters (bases, amino acids), e.g. \u2018at least 0.95 (A+T)-rich\u2019. It is based on an algorithm to find the longest interval having a non-negative sum in a sequence of positive and negative numbers. In practice, it runs in linear time; this can be guaranteed if the bias is rational.<\/jats:p>\n               <jats:p>Availability: Java code of the algorithm can be found at http:\/\/www.csse.monash.edu.au\/~lloyd\/tildeProgLang\/Java2\/Biased\/<\/jats:p>\n               <jats:p>Contact: lloyd@bruce.cs.monash.edu.au<\/jats:p>\n               <jats:p>Supplementary information: Examples of applications to Plasmodium falciparum genomic DNA can be found at the above URL.<\/jats:p>\n               <jats:p>* To whom correspondence should be addressed.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btg135","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T23:09:17Z","timestamp":1057014557000},"page":"1294-1295","source":"Crossref","is-referenced-by-count":26,"title":["Longest biased interval and longest non-negative sum interval"],"prefix":"10.1093","volume":"19","author":[{"given":"Lloyd","family":"Allison","sequence":"first","affiliation":[{"name":"School of Computer Science and Software Engineering, Monash University, Clayton, Victoria, Australia 3800"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"286","published-online":{"date-parts":[[2003,7,1]]},"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/19\/10\/1294\/48903824\/bioinformatics_19_10_1294.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/19\/10\/1294\/48903824\/bioinformatics_19_10_1294.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T15:50:59Z","timestamp":1674661859000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/19\/10\/1294\/184259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,7,1]]},"references-count":0,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2003,7,1]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btg135","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2003,7,1]]},"published":{"date-parts":[[2003,7,1]]}}}