10
views
0
recommends
+1 Recommend
0 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: not found

      FAST: Fourier transform based algorithms for significance testing of ungapped multiple alignments.

      Bioinformatics
      Algorithms, Computational Biology, methods, Fourier Analysis, Sequence Alignment

      Read this article at

      ScienceOpenPublisherPubMed
      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          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. 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.

          Related collections

          Author and article information

          Journal
          18180239
          10.1093/bioinformatics/btm594

          Chemistry
          Algorithms,Computational Biology,methods,Fourier Analysis,Sequence Alignment
          Chemistry
          Algorithms, Computational Biology, methods, Fourier Analysis, Sequence Alignment

          Comments

          Comment on this article