{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,6]],"date-time":"2023-09-06T08:25:42Z","timestamp":1693988742177},"reference-count":6,"publisher":"Oxford University Press (OUP)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,2,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Summary: As was shown in Nagarajan et al. (2005), commonly used approximations for assessing the significance of multiple alignments can be be very inaccurate. To address this, we present here the FAST package, an open-source collection of programs and libraries for efficiently and reliably computing the significance of ungapped local alignments. We also describe other potential applications in Bioinformatics where these programs can be adapted for significance testing.<\/jats:p>\n               <jats:p>Availability: The FAST package includes C++ implementations of various algorithms that can be used as stand-alone programs or as a library of subroutines. The package and a web-server for some of the programs are available at www.cs.cornell.edu\/~keich\/FAST<\/jats:p>\n               <jats:p>Contact: \u00a0keich@cs.cornell.edu<\/jats:p>\n               <jats:p>Supplementary information: Supplementary data are available at Bioinformatics online.<\/jats:p>","DOI":"10.1093\/bioinformatics\/btm594","type":"journal-article","created":{"date-parts":[[2008,1,8]],"date-time":"2008-01-08T01:12:58Z","timestamp":1199754778000},"page":"577-578","source":"Crossref","is-referenced-by-count":6,"title":["FAST: Fourier transform based algorithms for significance testing of ungapped multiple alignments"],"prefix":"10.1093","volume":"24","author":[{"given":"Niranjan","family":"Nagarajan","sequence":"first","affiliation":[{"name":"1 University of Maryland, College Park, MD-20740 and 2Cornell University, Ithaca, NY-14850, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Keich","sequence":"additional","affiliation":[{"name":"1 University of Maryland, College Park, MD-20740 and 2Cornell University, Ithaca, NY-14850, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2008,1,6]]},"reference":[{"key":"2023020209510027600_B1","first-page":"28","article-title":"Fitting a mixture model by expectation maximization to discover motifs in biopolymers","author":"Bailey","year":"1994"},{"key":"2023020209510027600_B2","doi-asserted-by":"crossref","DOI":"10.1007\/11851561_12","article-title":"Procrastination leads to efficient filtration for local multiple alignment","author":"Darling","year":"2006"},{"key":"2023020209510027600_B3","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1093\/bioinformatics\/15.7.563","article-title":"Identifying DNA and protein patterns with statistically significant alignments of multiple sequences","volume":"15","author":"Hertz","year":"1999","journal-title":"Bioinformatics"},{"key":"2023020209510027600_B4","doi-asserted-by":"crossref","first-page":"i311","DOI":"10.1093\/bioinformatics\/bti1044","article-title":"Computing the P-value of the information content from an alignment of multiple sequences","volume":"21","author":"Nagarajan","year":"2005","journal-title":"Bioinformatics"},{"key":"2023020209510027600_B5","article-title":"Refining motif finders with E-value calculations","author":"Nagarajan","year":"2006"},{"key":"2023020209510027600_B6","doi-asserted-by":"crossref","DOI":"10.1186\/1471-2105-5-106","article-title":"Estimates of statistical significance for comparison of individual positions in multiple sequence alignments","volume":"5","author":"Sadreyev","year":"2004","journal-title":"BMC Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/4\/577\/49045607\/bioinformatics_24_4_577.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/24\/4\/577\/49045607\/bioinformatics_24_4_577.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,2]],"date-time":"2023-02-02T09:56:20Z","timestamp":1675331780000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/24\/4\/577\/206570"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1,6]]},"references-count":6,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,2,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btm594","relation":{},"ISSN":["1367-4811","1367-4803"],"issn-type":[{"value":"1367-4811","type":"electronic"},{"value":"1367-4803","type":"print"}],"subject":[],"published-other":{"date-parts":[[2008,2,15]]},"published":{"date-parts":[[2008,1,6]]}}}