{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T10:12:09Z","timestamp":1761559929382},"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>Motivation: Efficient clustering is important for handling the large amount of available EST sequences. Most contemporary methods are based on some kind of all-against-all comparison, resulting in a quadratic time complexity. A different approach is needed to keep up with the rapid growth of EST data.<\/jats:p>\n               <jats:p>Results: A new, fast EST clustering algorithm is presented. Sub-quadratic time complexity is achieved by using an algorithm based on suffix arrays. A prototype implementation has been developed and run on a benchmark data set. The produced clusterings are validated by comparing them to clusterings produced by other methods, and the results are quite promising.<\/jats:p>\n               <jats:p>Availability: The source code for the prototype implementation is available under a GPL license from http:\/\/www.ii.uib.no\/~ketil\/bio\/<\/jats:p>\n               <jats:p>Contact: ketil@ii.uib.no<\/jats:p>\n               <jats:p>* To whom correspondence should be addressed.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btg138","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T23:09:17Z","timestamp":1057014557000},"page":"1221-1226","source":"Crossref","is-referenced-by-count":29,"title":["Fast sequence clustering using a suffix array algorithm"],"prefix":"10.1093","volume":"19","author":[{"given":"Ketil","family":"Malde","sequence":"first","affiliation":[{"name":"Department of Informatics, University of Bergen, HIB, N5020 Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eivind","family":"Coward","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Bergen, HIB, N5020 Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Inge","family":"Jonassen","sequence":"additional","affiliation":[{"name":"Department of Informatics, University of Bergen, HIB, N5020 Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"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\/1221\/48903790\/bioinformatics_19_10_1221.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/19\/10\/1221\/48903790\/bioinformatics_19_10_1221.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,25]],"date-time":"2023-01-25T15:50:27Z","timestamp":1674661827000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/19\/10\/1221\/184311"}},"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\/btg138","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]]}}}