diff lastz_d.xml @ 8:e7f19d6a9af8 draft

planemo upload for repository https://github.com/galaxyproject/tools-iuc/tree/master/tools/lastz commit a7e9d5b3906b7ebb35b1c29c3a8e8203b2cefccd

--- a/lastz_d.xml	Thu May 17 04:29:13 2018 -0400
+++ b/lastz_d.xml	Fri May 18 16:58:38 2018 -0400
@@ -1,4 +1,4 @@
-<tool id="lastz_d_wrapper" name="LASTZ_D" version="1.3.1">
+<tool id="lastz_d_wrapper" name="LASTZ_D" version="1.3.2">
     <description>: estimate substitution scores matrix</description>
     <macros>
     	<import>lastz_macros.xml</import>
@@ -45,39 +45,39 @@
 
     <help><![CDATA[
 
-        **What is does**
+**What is does**
 
-        LASTZ_D is a non-integer (**D** stands for Double) version of LASTZ that can be used to estimate substitution matrix that will be used to score alignments. It was developed by `Bob Harris <http://www.bx.psu.edu/~rsharris/>`_ in the lab of Webb Miller at Penn State as a part of LASTZ. Matrix computed by this tool is to be used by LASTZ (see below).
+LASTZ_D is a non-integer (**D** stands for Double) version of LASTZ that can be used to estimate substitution matrix that will be used to score alignments. It was developed by `Bob Harris <http://www.bx.psu.edu/~rsharris/>`_ in the lab of Webb Miller at Penn State as a part of LASTZ. Matrix computed by this tool is to be used by LASTZ (see below).
 
-        .. class:: warningmark
+.. class:: warningmark
 
-        **Read documentation** before proceeding. LASTZ is a complex tool with many parameter options. Fortunately, there is a `great manual <https://lastz.github.io/lastz/>`_ maintained by its author. The two sections that are particularly relevant to the inference of substitution matrix are `Inferring Score Sets <http://www.bx.psu.edu/~rsharris/lastz/README.lastz-1.04.00.html#adv_inference>`_ and `Inference Control File <http://www.bx.psu.edu/~rsharris/lastz/README.lastz-1.04.00.html#fmt_inference>`_.
+**Read documentation** before proceeding. LASTZ is a complex tool with many parameter options. Fortunately, there is a `great manual <https://lastz.github.io/lastz/>`_ maintained by its author. The two sections that are particularly relevant to the inference of substitution matrix are `Inferring Score Sets <http://www.bx.psu.edu/~rsharris/lastz/README.lastz-1.04.00.html#adv_inference>`_ and `Inference Control File <http://www.bx.psu.edu/~rsharris/lastz/README.lastz-1.04.00.html#fmt_inference>`_.
 
-        **Notes on the inference**
+**Notes on the inference**
 
-        Inference is achieved by computing the probability of each of the 18 different alignment events (gap open, gap extend, and 16 substitutions). These probabilities are estimated from alignments of the sequences. Of course, at first we don't have alignments, so the process begins by using a generic scoring set to create alignments, infer scores from those, then realign, and so on, until the scores stabilize or "converge". Ungapped alignments are performed until the substitution scores converge, then gapped alignments are performed (holding the substitution scores constant) until the gap penalties converge. In the end you get a matrix like this::
+Inference is achieved by computing the probability of each of the 18 different alignment events (gap open, gap extend, and 16 substitutions). These probabilities are estimated from alignments of the sequences. Of course, at first we don't have alignments, so the process begins by using a generic scoring set to create alignments, infer scores from those, then realign, and so on, until the scores stabilize or "converge". Ungapped alignments are performed until the substitution scores converge, then gapped alignments are performed (holding the substitution scores constant) until the gap penalties converge. In the end you get a matrix like this::
 
-            # (a LASTZ scoring set, created by "LASTZ --infer")
+    # (a LASTZ scoring set, created by "LASTZ --infer")
 
-            bad_score          = X:-1781 # used for sub[X][*] and sub[*][X]
-            fill_score         = -178    # used when sub[*][*] not otherwise defined
-            gap_open_penalty   = 400
-            gap_extend_penalty = 30
+    bad_score          = X:-1781 # used for sub[X][*] and sub[*][X]
+    fill_score         = -178    # used when sub[*][*] not otherwise defined
+    gap_open_penalty   = 400
+    gap_extend_penalty = 30
 
-                  A     C     G     T
-            A    72   -79   -49   -97
-            C   -79   100  -178   -49
-            G   -49  -178   100   -79
-            T   -97   -49   -79    72
+          A     C     G     T
+    A    72   -79   -49   -97
+    C   -79   100  -178   -49
+    G   -49  -178   100   -79
+    T   -97   -49   -79    72
 
-        This dataset can then be used as an input to the **Read the substitution scores** parameter of LASTZ (Parameter section *Scoring*).
+This dataset can then be used as an input to the **Read the substitution scores** parameter of LASTZ (Parameter section *Scoring*).
 
-        The iterative process can fail if there's not a lot of sequence to align.  E.g. if after the 4th iteration there's nothing in the central 50% denominators go to zero and the process fails.
+The iterative process can fail if there's not a lot of sequence to align.  E.g. if after the 4th iteration there's nothing in the central 50% denominators go to zero and the process fails.
 
-        If the sequences you are aligning have GC content different than the usual ACGT 30-20-20-30 split, scoring inference should discover this and give you better alignments.
+If the sequences you are aligning have GC content different than the usual ACGT 30-20-20-30 split, scoring inference should discover this and give you better alignments.
 
 
-        ]]>
+]]>
     </help>
     <expand macro="citations"/>
 </tool>