mirror of
https://git.FreeBSD.org/ports.git
synced 2024-12-24 04:33:24 +00:00
8c0e82e57e
The name stands for multiple sequence comparison by log-expectation. A range of options is provided that give you the choice of optimizing accuracy, speed, or some compromise between the two. Default parameters are those that give the best average accuracy in the published tests. MUSCLE can achieve both better average accuracy and better speed than CLUSTALW or T-Coffee, depending on the chosen options. Citation: Edgar, R. C. (2004) MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research 32(5): 1792-1797. Edgar, R. C. (2004) MUSCLE: a multiple sequence alignment method with reduced time and space complexity. BMC Bioinformatics 5(1): 113. The NAR paper gives only a brief overview of the algorithm and implementation details. For a full discussion of the method and many of the non-default options that it offers, please see the BMC paper. WWW: http://www.drive5.com/muscle/ PR: ports/118460 Submitted by: Motomichi Matsuzaki <mzaki@biol.s.u-tokyo.ac.jp>
31 lines
581 B
C++
31 lines
581 B
C++
--- intmath.cpp.orig Tue Nov 30 05:09:50 2004
|
|
+++ intmath.cpp Mon Jul 4 07:49:45 2005
|
|
@@ -8,13 +8,6 @@
|
|
return (PROB) pow(2.0, (double) Score/INTSCALE);
|
|
}
|
|
|
|
-static const double log2e = log2(exp(1.0));
|
|
-
|
|
-double lnTolog2(double ln)
|
|
- {
|
|
- return ln*log2e;
|
|
- }
|
|
-
|
|
double log2(double x)
|
|
{
|
|
if (0 == x)
|
|
@@ -24,6 +17,13 @@
|
|
// Multiply by inverse of log(2) just in case multiplication
|
|
// is faster than division.
|
|
return log(x)*dInvLn2;
|
|
+ }
|
|
+
|
|
+static const double log2e = log2(exp(1.0));
|
|
+
|
|
+double lnTolog2(double ln)
|
|
+ {
|
|
+ return ln*log2e;
|
|
}
|
|
|
|
SCORE ProbToScore(PROB Prob)
|