comparison bwa_macros.xml @ 20:4f774c1e6049 draft

planemo upload for repository https://github.com/galaxyproject/tools-iuc/tree/master/tools/bwa commit 4a306ebd8b7808ce963a69a3b15dd860c1fde585

19:dfd8b7f78c37

                    <option value="is">IS linear-time algorithm for constructing suffix array. It requires 5.37N memory where N is the size of the database. IS is moderately fast, but does not work with database larger than 2GB</option>
                    <option value="bwtsw">BWT-SW algorithm. This method works also with big genomes</option>
                </param>
            </when>
        </conditional>
    </macro>

    <macro name="dbKeyActionsBwa">
        <expand macro="dbKeyActions">
            <option type="from_data_table" name="bwa_indexes" column="1" offset="0">
                <filter type="param_value" column="0" value="#" compare="startswith" keep="False"/>
                <filter type="param_value" ref="reference_source.ref_file" column="0"/>
            </option>
        </expand>
    </macro>

    <macro name="dbKeyActionsBwaMem">
        <expand macro="dbKeyActions">
            <option type="from_data_table" name="bwa_mem_indexes" column="1" offset="0">

20:4f774c1e6049

                    <option value="is">IS linear-time algorithm for constructing suffix array. It requires 5.37N memory where N is the size of the database. IS is moderately fast, but does not work with database larger than 2GB</option>
                    <option value="bwtsw">BWT-SW algorithm. This method works also with big genomes</option>
                </param>
            </when>
        </conditional>
    </macro>

    <macro name="dbKeyActionsBwaMem">
        <expand macro="dbKeyActions">
            <option type="from_data_table" name="bwa_mem_indexes" column="1" offset="0">