<tools xmlns="biotoolsSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="biotoolsSchema file:///E:/repos/GitHub/biotoolsShim/genericxml2xml/versions/biotools-3.3.0/biotools_3.3.0.xsd"><tool><name>Jalview</name><description>Jalview is a free cross-platform program for multiple sequence alignment editing, visualisation and analysis. Use it to align, view and edit sequence alignments, analyse them with phylogenetic trees and principal components analysis (PCA) plots and explore molecular structures and annotation.</description><homepage>https://www.jalview.org/</homepage><biotoolsID>Jalview</biotoolsID><biotoolsCURIE>biotools:Jalview</biotoolsCURIE><version>2.11.5.1</version><toolType>Desktop application</toolType><toolType>Command-line tool</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><topic><uri>http://edamontology.org/topic_0092</uri><term>Data visualisation</term></topic><operatingSystem>Mac</operatingSystem><operatingSystem>Linux</operatingSystem><operatingSystem>Windows</operatingSystem><license>GPL-3.0</license><collectionID>ELIXIR-UK</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><accessibility>Open access</accessibility><elixirPlatform>Tools</elixirPlatform><elixirPlatform>Interoperability</elixirPlatform><elixirNode>UK</elixirNode><function><operation><uri>http://edamontology.org/operation_3081</uri><term>Sequence alignment editing</term></operation><operation><uri>http://edamontology.org/operation_0324</uri><term>Phylogenetic tree analysis</term></operation><operation><uri>http://edamontology.org/operation_0564</uri><term>Sequence visualisation</term></operation><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1984</uri><term>FASTA-aln</term></format><format><uri>http://edamontology.org/format_3015</uri><term>Pileup</term></format><format><uri>http://edamontology.org/format_1938</uri><term>GFF2-seq</term></format><format><uri>http://edamontology.org/format_3313</uri><term>BLC</term></format><format><uri>http://edamontology.org/format_3311</uri><term>RNAML</term></format><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format><format><uri>http://edamontology.org/format_3774</uri><term>BioJSON (Jalview)</term></format><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_1477</uri><term>mmCIF</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_3016</uri><term>VCF</term></format><format><uri>http://edamontology.org/format_1961</uri><term>Stockholm format</term></format><format><uri>http://edamontology.org/format_1939</uri><term>GFF3-seq</term></format><format><uri>http://edamontology.org/format_1947</uri><term>GCG MSF</term></format></input><input><data><uri>http://edamontology.org/data_0886</uri><term>Structure alignment</term></data><format><uri>http://edamontology.org/format_1476</uri><term>PDB</term></format></input><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_3015</uri><term>Pileup</term></format><format><uri>http://edamontology.org/format_3313</uri><term>BLC</term></format><format><uri>http://edamontology.org/format_3774</uri><term>BioJSON (Jalview)</term></format><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_3464</uri><term>JSON</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1961</uri><term>Stockholm format</term></format><format><uri>http://edamontology.org/format_1947</uri><term>GCG MSF</term></format></output><output><data><uri>http://edamontology.org/data_2884</uri><term>Plot</term></data><format><uri>http://edamontology.org/format_3466</uri><term>EPS</term></format><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_3604</uri><term>SVG</term></format><format><uri>http://edamontology.org/format_3603</uri><term>PNG</term></format></output><note>Other Input formats:
AMSA (.amsa);
JnetFile (.concise, .jnet);
PFAM (.pfam);
Substitution matrix (.matrix);
Jalview Project File (.jvp);
Jalview Feature File (.features, .jvfeatures);
Jalview Annotations File (.annotations, .jvannotations);
Predicted Aligned Error (PAE) Matrix File (.json)
...
Other Output formats:
PFAM (.pfam);
BioJS (.biojs) (interactive HTML/Javascript);
Jalview Project File (.jvp);</note></function><link><url>https://discourse.jalview.org/</url><type>Discussion forum</type></link><link><url>https://issues.jalview.org/</url><type>Issue tracker</type></link><link><url>https://www.jalview.org/development/jalview_develop/</url><type>Other</type><note>Latest development version</note></link><link><url>https://gitlab.jalview.org/jalview/jalview.git</url><type>Repository</type></link><link><url>https://twitter.com/Jalview</url><type>Social media</type><note>Twitter feed</note></link><link><url>https://www.youtube.com/channel/UCIjpnvZB770yz7ftbrJ0tfw</url><type>Social media</type><note>YouTube training videos</note></link><link><url>https://www.linkedin.com/company/104771886/</url><type>Social media</type></link><download><url>https://www.jalview.org/download</url><type>Downloads page</type></download><download><url>https://www.jalview.org/download/source/</url><type>Source code</type></download><download><url>https://www.jalview.org/download/?os=all</url><type>Binaries</type><note>Binaries for all platforms</note></download><download><url>https://www.jalview.org/favicon.svg</url><type>Icon</type></download><download><url>https://www.jalview.org/download/other/jar/</url><type>Binaries</type><note>Executable JAR file</note></download><documentation><url>https://www.jalview.org/about/citation</url><type>Citation instructions</type></documentation><documentation><url>https://www.jalview.org/training/</url><type>Training material</type><note>Hands-on exercises, Training courses and Training videos</note></documentation><documentation><url>https://www.jalview.org/help/faq</url><type>FAQ</type></documentation><documentation><url>https://www.jalview.org/help/documentation/</url><type>User manual</type></documentation><relation><biotoolsID>jabaws</biotoolsID><type>uses</type></relation><relation><biotoolsID>chimera</biotoolsID><type>uses</type></relation><relation><biotoolsID>chimerax</biotoolsID><type>uses</type></relation><relation><biotoolsID>pymol</biotoolsID><type>uses</type></relation><relation><biotoolsID>bioconda</biotoolsID><type>includedIn</type></relation><relation><biotoolsID>3d-beacons</biotoolsID><type>uses</type></relation><relation><biotoolsID>uniprot</biotoolsID><type>uses</type></relation><relation><biotoolsID>pfam</biotoolsID><type>uses</type></relation><relation><biotoolsID>ensembl</biotoolsID><type>uses</type></relation><relation><biotoolsID>pdb</biotoolsID><type>uses</type></relation><relation><biotoolsID>rfam</biotoolsID><type>uses</type></relation><relation><biotoolsID>3d-beacons</biotoolsID><type>uses</type></relation><publication><doi>10.1093/bioinformatics/btp033</doi><pmid>19151095</pmid><pmcid>PMC2672624</pmcid></publication><credit><name>Jim Procter</name><url>http://www.lifesci.dundee.ac.uk/people/jim-procter</url><orcidid>https://orcid.org/0000-0002-7865-7382</orcidid><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><name>Geoff Barton</name><url>https://www.lifesci.dundee.ac.uk/people/geoff-barton</url><orcidid>https://orcid.org/0000-0002-9014-5355</orcidid></credit></tool><tool><name>trimAl</name><description>Tool for the automated removal of spurious sequences or poorly aligned regions from a multiple sequence alignment.</description><homepage>https://trimal.readthedocs.io</homepage><biotoolsID>trimal</biotoolsID><biotoolsCURIE>biotools:trimal</biotoolsCURIE><version>1.5.1</version><version>2.0-RC</version><toolType>Command-line tool</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><topic><uri>http://edamontology.org/topic_3168</uri><term>Sequencing</term></topic><topic><uri>http://edamontology.org/topic_0160</uri><term>Sequence sites, features and motifs</term></topic><operatingSystem>Mac</operatingSystem><operatingSystem>Windows</operatingSystem><operatingSystem>Linux</operatingSystem><language>C++</language><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0492</uri><term>Multiple sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data></input><output><data><uri>http://edamontology.org/data_1916</uri><term>Alignment</term></data><format><uri>http://edamontology.org/format_1998</uri><term>phylipnon</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format></output><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output></function><link><url>https://github.com/inab/trimal</url><type>Repository</type></link><download><url>https://github.com/inab/trimal</url><type>Source code</type><version>1.5.1</version></download><download><url>https://github.com/inab/trimal/tree/2.0_RC</url><type>Source code</type><version>2.0-RC</version></download><documentation><url>http://trimal.cgenomics.org/</url><type>General</type><note>Old versions</note></documentation><documentation><url>https://trimal.readthedocs.io</url><type>General</type></documentation><publication><doi>10.1093/bioinformatics/btp348</doi><pmid>19505945</pmid><pmcid>PMC2712344</pmcid></publication><credit><name>Salvador Capella-Gutierrez</name><email>salcagu@gmail.com</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><email>tgabaldon@crg.es</email><url>http://gabaldonlab.crg.es/</url><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>msa</name><description>Display multiple-sequence alignment. The tool is also available as R/BioConductor interface to the multiple sequence alignment algorithms ClustalW, ClustalOmega, and Muscle. All three algorithms are integrated in the package, therefore, they do not depend on any external software tools and are available for all major platforms.</description><homepage>http://msa.biojs.net</homepage><biotoolsID>msa</biotoolsID><biotoolsCURIE>biotools:msa</biotoolsCURIE><version>1.0.0</version><toolType>Command-line tool</toolType><toolType>Library</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><topic><uri>http://edamontology.org/topic_0160</uri><term>Sequence sites, features and motifs</term></topic><topic><uri>http://edamontology.org/topic_3293</uri><term>Phylogenetics</term></topic><topic><uri>http://edamontology.org/topic_3168</uri><term>Sequencing</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Windows</operatingSystem><operatingSystem>Mac</operatingSystem><language>JavaScript</language><license>Apache-2.0</license><collectionID>Rostlab tools</collectionID><collectionID>Bioconductor</collectionID><collectionID>BioJS</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0564</uri><term>Sequence visualisation</term></operation><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_1984</uri><term>FASTA-aln</term></format></input><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1984</uri><term>FASTA-aln</term></format></output><output><data><uri>http://edamontology.org/data_1711</uri><term>Sequence alignment image</term></data><format><uri>http://edamontology.org/format_3547</uri><term>Image format</term></format></output><output><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><output><data><uri>http://edamontology.org/data_1270</uri><term>Feature table</term></data><format><uri>http://edamontology.org/format_2305</uri><term>GFF</term></format></output><note>Visualizes multiple sequence alignment, calculates conservation, shows sequence logo, applies multiple color schemes A multiple sequence alignment (ClustalW, FASTA, ...) Exports selected sequences and regions from the alignment Images are exported in PNG Export sequences in FASTA format Export features in GFF
NOTE: Actually, all these output types of data should instead be under separate "constant" operations, while the visualisation should be an unary operation, perhaps without an output.</note></function><function><operation><uri>http://edamontology.org/operation_0492</uri><term>Multiple sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_2977</uri><term>Nucleic acid sequence</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1935</uri><term>GCG</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1927</uri><term>EMBL format</term></format><format><uri>http://edamontology.org/format_1936</uri><term>GenBank format</term></format></input><input><data><uri>http://edamontology.org/data_2976</uri><term>Protein sequence</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1935</uri><term>GCG</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1927</uri><term>EMBL format</term></format><format><uri>http://edamontology.org/format_1936</uri><term>GenBank format</term></format></input><output><data><uri>http://edamontology.org/data_0867</uri><term>Sequence alignment report</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_3508</uri><term>PDF</term></format></output></function><link><url>https://github.com/wilzbach/msa</url><type>Repository</type></link><link><url>http://biojs.io/</url><type>Software catalogue</type></link><link><url>http://github.com/wilzbach/msa</url><type>Helpdesk</type></link><link><url>http://www.bioinf.jku.at/software/msa/</url><type>Mirror</type></link><download><url>https://github.com/wilzbach/msa</url><type>Source code</type></download><download><url>https://cdn.bio.sh/</url><type>Binaries</type></download><documentation><url>https://github.com/wilzbach/msa/blob/master/LICENSE</url><type>Terms of use</type></documentation><documentation><url>http://msa.biojs.net</url><type>General</type></documentation><publication><doi>10.1093/bioinformatics/btw474</doi><pmid>27412096</pmid><pmcid>PMC5181560</pmcid><type>Primary</type></publication><publication><doi>10.1093/bioinformatics/btv494</doi><pmid>26315911</pmid><type>Other</type></publication><credit><name>Sebastian Wilzbach</name><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Ian Sillitoe</name><typeRole>Contributor</typeRole></credit><credit><name>Guy Yachdav</name><typeRole>Contributor</typeRole></credit><credit><name>Benedikt Rauscher</name><typeRole>Contributor</typeRole></credit><credit><name>Tatyana Goldberg</name><typeRole>Contributor</typeRole></credit><credit><name>Technische Universit&#228;t M&#252;nchen</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>Google Summer of Code (GSoC) 2014</name><typeEntity>Funding agency</typeEntity><typeRole>Contributor</typeRole></credit><credit><name>BioJS</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><url>http://github.com/wilzbach/msa</url><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><name>Ulrich Bodenhofer</name><email>bodenhofer@bioinf.jku.at</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>WAR</name><description>Easy-to-use webserver that makes it possible to simultaneously use the best methods for aligning and predicting the consensus secondary structure for a set of non-coding RNA sequences.</description><homepage>http://genome.ku.dk/resources/war/</homepage><biotoolsID>war</biotoolsID><biotoolsCURIE>biotools:war</biotoolsCURIE><version>1</version><toolType>Web application</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Windows</operatingSystem><operatingSystem>Mac</operatingSystem><function><operation><uri>http://edamontology.org/operation_0278</uri><term>RNA secondary structure prediction</term></operation><operation><uri>http://edamontology.org/operation_0292</uri><term>Sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3495</uri><term>RNA sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1961</uri><term>Stockholm format</term></format></input><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_1961</uri><term>Stockholm format</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output></function><documentation><url>http://genome.ku.dk/resources/war/pages/about.php</url><type>General</type></documentation><publication><doi>10.1093/nar/gkn275</doi><pmid>18492721</pmid><pmcid>PMC2447782</pmcid><type>Primary</type></publication><credit><name>binf.ku.dk</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>Stinus Lindgreen</name><email>stinus@binf.ku.dk</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>ClustalW (BioLib)</name><description>ClustalW is a general purpose multiple sequence alignment program for DNA or proteins</description><homepage>https://biolib.com/bio-utils/clustalw/</homepage><biotoolsID>clustalw_biolib</biotoolsID><biotoolsCURIE>biotools:clustalw_biolib</biotoolsCURIE><version>2.1.</version><toolType>Web application</toolType><toolType>Web API</toolType><toolType>Command-line tool</toolType><toolType>Bioinformatics portal</toolType><topic><uri>http://edamontology.org/topic_3293</uri><term>Phylogenetics</term></topic><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><operatingSystem>Mac</operatingSystem><operatingSystem>Linux</operatingSystem><operatingSystem>Windows</operatingSystem><license>LGPL-3.0</license><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0292</uri><term>Sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1949</uri><term>nexus-seq</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format></output><cmd>clustalw -INPUT=sequences.fasta -OUTFILE=alignment.fasta -OUTPUT=FASTA</cmd></function><documentation><url>http://www.clustal.org/clustal2/</url><type>General</type></documentation><publication><doi>10.1093/bioinformatics/btm404</doi><pmid>17846036</pmid></publication></tool><tool><name>MUSCLE</name><description>This tool performs multiple sequence alignments of nucleotide or amino acid sequences.</description><homepage>https://www.drive5.com/muscle/</homepage><biotoolsID>muscle</biotoolsID><biotoolsCURIE>biotools:muscle</biotoolsCURIE><version>5</version><toolType>Command-line tool</toolType><toolType>Web API</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Windows</operatingSystem><operatingSystem>Mac</operatingSystem><license>Other</license><collectionID>MUSCLE</collectionID><collectionID>galaxyPasteur</collectionID><collectionID>BioConductor</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><accessibility>Open access</accessibility><function><operation><uri>http://edamontology.org/operation_0492</uri><term>Multiple sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3494</uri><term>DNA sequence</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1935</uri><term>GCG</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1927</uri><term>EMBL format</term></format><format><uri>http://edamontology.org/format_1936</uri><term>GenBank format</term></format></input><input><data><uri>http://edamontology.org/data_3495</uri><term>RNA sequence</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1935</uri><term>GCG</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1927</uri><term>EMBL format</term></format><format><uri>http://edamontology.org/format_1936</uri><term>GenBank format</term></format></input><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1947</uri><term>GCG MSF</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output></function><link><url>https://www.biocatalogue.org/services/3135</url><type>Software catalogue</type></link><link><url>https://galaxy.pasteur.fr/tool_runner?tool_id=toolshed.pasteur.fr/repos/fmareuil/oneclick_phylogeny/muscle/3.8.31.1</url><type>Galaxy service</type></link><download><url>http://bioconductor/packages/release/bioc/src/contrib/muscle_3.16.0.tar.gz</url><type>Source code</type><note>BioConductor package</note></download><download><url>https://www.ebi.ac.uk/seqdb/confluence/display/WEBSERVICES/muscle_rest</url><type>API specification</type><note>EBI MUSCLE Web Service</note></download><download><url>https://www.drive5.com/muscle/downloads.htm</url><type>Downloads page</type></download><documentation><url>http://bioconductor.org/packages/release/bioc/html/muscle.html</url><type>User manual</type><note>BioConductor package documentation</note></documentation><documentation><url>https://www.ebi.ac.uk/seqdb/confluence/display/WEBSERVICES/muscle_rest</url><type>API documentation</type><note>EBI Web Service documentation</note></documentation><documentation><url>https://www.drive5.com/muscle/manual/</url><type>User manual</type></documentation><documentation><url>https://www.drive5.com/muscle/manual/install.html</url><type>Installation instructions</type></documentation><publication><doi>10.1093/nar/gkh340</doi><pmid>15034147</pmid><pmcid>PMC390337</pmcid><type>Primary</type></publication><publication><doi>10.7490/f1000research.1114334.1</doi><type>Primary</type><version>5</version></publication><publication><doi>10.1186/1471-2105-5-113</doi><pmid>15318951</pmid><pmcid>PMC517706</pmcid><type>Other</type></publication><publication><doi>10.1101/2021.06.20.449169</doi><type>Primary</type><version>5</version></publication><credit><name>Alex T. Kalinka</name><email>alex.t.kalinka@gmail.com</email><typeEntity>Person</typeEntity><typeRole>Maintainer</typeRole><note>Maintainer of the BioConductor package</note></credit><credit><url>http://www.ebi.ac.uk/support/</url><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole><note>EBI Web Service support</note></credit><credit><name>Technical Support</name><url>https://www.drive5.com/muscle/manual/support.html</url></credit><credit><name>Robert Edgar</name><email>robert@drive5.com</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole><typeRole>Developer</typeRole></credit></tool><tool><name>kc-align</name><description>A fast and accurate tool for performing codon-aware multiple sequence alignments. 

Kc-Align is a codon-aware multiple aligner that uses Kalgin2 to produce in-frame gapped codon alignments for selection analysis of small genomes (mostly viral and some smaller bacterial genomes). Takes nucleotide seqeunces as inputs, converts them to their in-frame amino acid sequences, performs multiple alignment with Kalign, and then converts the alignments back to their original codon sequence while preserving the gaps. Produces three outputs: the gapped nucleotide alignments in FASTA format and in CLUSTAL format and the amino acid level alignment.

Kc-Align will also attempt to detect any frameshift mutations in the input reads. If a frameshift is detected, that sequence will not be included in the multiple alignment and its ID will be printed to stdout.</description><homepage>https://github.com/davebx/kc-align</homepage><biotoolsID>kc-align</biotoolsID><biotoolsCURIE>biotools:kc-align</biotoolsCURIE><version>1.0</version><toolType>Command-line tool</toolType><topic><uri>http://edamontology.org/topic_0102</uri><term>Mapping</term></topic><license>AFL-3.0</license><accessibility>Open access</accessibility><function><operation><uri>http://edamontology.org/operation_0492</uri><term>Multiple sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3494</uri><term>DNA sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1383</uri><term>Nucleic acid sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><cmd>kc-align -m genome -r reference.fasta -S sequences.fasta -s 3532,3892 -e 3894,5326</cmd></function><documentation><url>https://github.com/davebx/kc-align/blob/dev/README.md</url><type>General</type></documentation></tool><tool><name>MEME Suite</name><description>Unified portal for discovery and analysis of sequence motifs (e.g. DNA binding sites, protein interaction domains). Motifs with/without gaps may be discovered, searched for in DNA and protein databases, compared to other motifs and analyzed for putative function by association with gene ontology terms. MEME is a tool designed for discovering and searching for DNA motifs such as transcription factor binding sites (TFBS) or protein domains.</description><homepage>http://meme-suite.org/</homepage><biotoolsID>meme_suite</biotoolsID><biotoolsCURIE>biotools:meme_suite</biotoolsCURIE><toolType>Command-line tool</toolType><toolType>Web application</toolType><toolType>Suite</toolType><topic><uri>http://edamontology.org/topic_0749</uri><term>Transcription factors and regulatory sites</term></topic><topic><uri>http://edamontology.org/topic_0203</uri><term>Gene expression</term></topic><topic><uri>http://edamontology.org/topic_3125</uri><term>DNA binding sites</term></topic><topic><uri>http://edamontology.org/topic_0736</uri><term>Protein folds and structural domains</term></topic><topic><uri>http://edamontology.org/topic_0160</uri><term>Sequence sites, features and motifs</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Windows</operatingSystem><operatingSystem>Mac</operatingSystem><function><operation><uri>http://edamontology.org/operation_0238</uri><term>Sequence motif discovery</term></operation><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output><note>MEME is a tool for discovering motifs in a group of related DNA or protein sequences. Note that MEME does not attempt to detect the alphabet from the sequences so you should specify it with the -dna or -protein options.</note></function><function><operation><uri>http://edamontology.org/operation_0238</uri><term>Sequence motif discovery</term></operation><operation><uri>http://edamontology.org/operation_0415</uri><term>Nucleic acid feature detection</term></operation><operation><uri>http://edamontology.org/operation_2575</uri><term>Protein binding site prediction</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><input><data><uri>http://edamontology.org/data_1234</uri><term>Sequence set (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format></output><note>MEME-ChIP performs several motif analysis steps on a set of DNA sequences that you provide. It is especially appropriate for analyzing the bound genomic regions identified in a transcription factor (TF) ChIP-seq experiment.MEME-ChIP can (1) discover novel DNA-binding motifs (with MEME and DREME), (2) determine which motifs are most centrally enriched (with CentriMo), (3) analyze them for similarity to known binding motifs (with Tomtom), and (4) automatically group the found motifs by similarity. A database of DNA motifs in MEME format. The immediate regions around individual ChIP-seq "peaks" from a transcription factor (TF) ChIP-seq experiment are ideal. MEME ChIP runs each program in its analysis in a different folder in the output directory. A summary file (index.html) is created in the output directory which lists the top motifs found and links to the results for each program.</note></function><function><operation><uri>http://edamontology.org/operation_0238</uri><term>Sequence motif discovery</term></operation><input><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><input><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>DREME (Discriminative Regular Expression Motif Elicitation) finds relatively short motifs (up to 8 bases) fast, and can perform discriminative motif discovery if given a negative set, consisting of sequences unlikely to contain a motif of interest that is however likely to be found in the main ("positive") sequence set. The sequences should all be approximately the same length. If these sequences are not supplied then the program will shuffle the positive sequences and use that set for the negative sequences. DREME writes an XML file to the output folder and converts it into a minimal MEME-formatted motif file and a human readable html file.</note></function><function><operation><uri>http://edamontology.org/operation_0238</uri><term>Sequence motif discovery</term></operation><operation><uri>http://edamontology.org/operation_0415</uri><term>Nucleic acid feature detection</term></operation><input><data><uri>http://edamontology.org/data_1255</uri><term>Sequence features</term></data></input><input><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output><note>GLAM2 is a program for finding motifs in sequences, typically amino-acid or nucleotide sequences. The main innovation of GLAM2 is that it allows insertions and deletions in motifs. The Alphabet of the sequences. This can be 'p' for protein sequences, 'n' for nucleotide sequences or the name of an GLAM2 alphabet file. A file containing FASTA formatted sequences.</note></function><function><operation><uri>http://edamontology.org/operation_3501</uri><term>Enrichment analysis</term></operation><operation><uri>http://edamontology.org/operation_2238</uri><term>Statistical calculation</term></operation><input><data><uri>http://edamontology.org/data_3494</uri><term>DNA sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><input><data><uri>http://edamontology.org/data_2070</uri><term>Sequence motif (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><output><data><uri>http://edamontology.org/data_0951</uri><term>Statistical estimate score</term></data><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output><note>AME (Analysis of Motif Enrichment) scores a set of DNA sequences given a set of DNA-binding motifs, treating each subsequence (and its reverse complement) in the sequence as a possible match to the motif. The sequences must be sorted by increasing value of some secondary criterion (e.g., expression level, peak height, fluorescence score). More than one file can be specified.</note></function><function><operation><uri>http://edamontology.org/operation_0300</uri><term>Sequence profile alignment</term></operation><operation><uri>http://edamontology.org/operation_3501</uri><term>Enrichment analysis</term></operation><operation><uri>http://edamontology.org/operation_0337</uri><term>Visualisation</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><input><data><uri>http://edamontology.org/data_1234</uri><term>Sequence set (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_0869</uri><term>Sequence-profile alignment</term></data><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output><note>CentriMo takes a set of motifs and a set of equal-length DNA or RNA sequences and plots the positional distribution of the best match of each motif. Ideally all of the same length. CentriMo outputs an HTML file that allows interactive selection of which motifs to plot the positional distribution for and control over smoothing and other plotting parameters.</note></function><function><operation><uri>http://edamontology.org/operation_0445</uri><term>Transcription factor binding site prediction</term></operation><input><data><uri>http://edamontology.org/data_1234</uri><term>Sequence set (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><input><data><uri>http://edamontology.org/data_2070</uri><term>Sequence motif (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><input><data><uri>http://edamontology.org/data_2070</uri><term>Sequence motif (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format></output><note>SpaMo does inference of transcription factor complexes by looking for significant spacings between binding sites. This would typically be generated by expanding either side of a ChIP-seq peak to obtain sequences of about 500 bases in length. The primary motif is the motif for which you are trying to find cofactors. One or more MEME formatted motif files containing DNA motifs. The secondary motifs are tested for a significant spacing with the primary motif which might imply they act together.</note></function><function><operation><uri>http://edamontology.org/operation_0226</uri><term>Annotation</term></operation><operation><uri>http://edamontology.org/operation_3501</uri><term>Enrichment analysis</term></operation><input><data><uri>http://edamontology.org/data_0582</uri><term>Ontology</term></data></input><input><data><uri>http://edamontology.org/data_1772</uri><term>Score</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format></input><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format></output><note>The name GOMO stands for "Gene Ontology for Motifs." The program searches in a set of ranked genes for enriched GO terms associated with high ranking genes. In other words, it identifies possible roles (Gene Ontology terms) for DNA binding motifs. A collection of GO terms mapped to to the sequences in the scoring file A XML file which contains for each motif the sequences and their score. By default GOMO calculates the ranksum statistics on the p-values of each gene given in the CisML input file.</note></function><function><operation><uri>http://edamontology.org/operation_3438</uri><term>Calculation</term></operation><operation><uri>http://edamontology.org/operation_0239</uri><term>Sequence motif recognition</term></operation><input><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data></output><note>The name FIMO stands for "Find Individual Motif Occurences." The program searches a database of DNA or protein sequences for occurrences of known motifs, treating each motif independently. See documentation for more details.</note></function><function><operation><uri>http://edamontology.org/operation_0300</uri><term>Sequence profile alignment</term></operation><operation><uri>http://edamontology.org/operation_0338</uri><term>Sequence database search</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_0857</uri><term>Sequence search results</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format></output><note>MAST is a tool for searching biological sequence databases for sequences that contain one or more of a group of known motifs. MAST outputs three things: (1) The names of the high-scoring sequences sorted by the strength of the combined match of the sequence to all of the motifs in the group. (2) Motif diagrams showing the order and spacing of the motifs within each matching sequence. (3) Detailed annotation of each matching sequence showing the sequence and the locations and strengths of matches to the motifs.</note></function><function><operation><uri>http://edamontology.org/operation_0291</uri><term>Sequence clustering</term></operation><operation><uri>http://edamontology.org/operation_0338</uri><term>Sequence database search</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><input><data><uri>http://edamontology.org/data_1234</uri><term>Sequence set (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data></output><note>MCAST searches a sequence database for statistically significant clusters of non-overlapping occurrences of a given set of motifs. See documentation for more details.</note></function><function><operation><uri>http://edamontology.org/operation_0300</uri><term>Sequence profile alignment</term></operation><operation><uri>http://edamontology.org/operation_0338</uri><term>Sequence database search</term></operation><input><data><uri>http://edamontology.org/data_1255</uri><term>Sequence features</term></data></input><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data></input><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_0857</uri><term>Sequence search results</term></data></output><note>GLAM2SCAN finds matches, in a sequence database, to a motif discovered by GLAM2. Each match receives a score, indicating how well it fits the motif. The alphabet of the motif and sequences. This can be 'p' for protein sequences, 'n' for nucleotide sequences or the name of an GLAM2 alphabet file. A file containing a GLAM2 motif.</note></function><function><operation><uri>http://edamontology.org/operation_2421</uri><term>Database search</term></operation><operation><uri>http://edamontology.org/operation_0300</uri><term>Sequence profile alignment</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><output><data><uri>http://edamontology.org/data_2080</uri><term>Database search results</term></data><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output><note>The Tomtom program searches one or more query motifs against one or more databases of target motifs (and their DNA reverse complements), and reports for each query a list of target motifs, ranked by p-value. One or more files containing one or more motifs in MEME format.</note></function><function><operation><uri>http://edamontology.org/operation_0361</uri><term>Sequence annotation</term></operation><operation><uri>http://edamontology.org/operation_2575</uri><term>Protein binding site prediction</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><input><data><uri>http://edamontology.org/data_1234</uri><term>Sequence set (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><input><data><uri>http://edamontology.org/data_1364</uri><term>Hidden Markov model</term></data></input><output><data><uri>http://edamontology.org/data_3002</uri><term>Annotation track</term></data><format><uri>http://edamontology.org/format_2305</uri><term>GFF</term></format></output><note>The name AMA stands for "Average Motif Affinity". The program scores a set of DNA sequences given a DNA-binding motif, treating each position in the sequence as a possible binding event. A file containing 0-order Markov Model in background model format such as produced by fasta-get-markov.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_2854</uri><term>Position-specific scoring matrix</term></data><format><uri>http://edamontology.org/format_3597</uri><term>psd</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert an BEEML matrix file into a MEME motif file suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_2854</uri><term>Position-specific scoring matrix</term></data></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Read a CHEN matrix file and convert to MEME format. You may concatenate files for more than one motif.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1197</uri><term>InChI</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert an IUPAC motif into MEME motif format suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1367</uri><term>JASPAR format</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert a directory of JASPAR files into a MEME motif suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert and merge multiple MEME formatted files into a single minimal meme format file.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_2854</uri><term>Position-specific scoring matrix</term></data></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert a nestedMICA (BioTiffin/XMS) matrix file into a MEME motif file suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_2854</uri><term>Position-specific scoring matrix</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert an PRIORITY matrix file into a MEME motif file suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_1097</uri><term>Sequence accession (nucleic acid)</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert an RNA sequence to its binding motif in MEME motif format.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_1361</uri><term>Position frequency matrix</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert an SCPD matrix file into a MEME motif suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert a directory of files containing sites into a MEME motif file suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_2854</uri><term>Position-specific scoring matrix</term></data><format><uri>http://edamontology.org/format_3752</uri><term>CSV</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert a file containing the tab separated columns exported from the spreadsheet of Taipale results into MEME motif format. A Taipale file describes one or more motifs in terms of a probability matrix in column orientation.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert a TAMO file into a MEME motif file suitable for use with MEME Suite programs. A TAMO file describes one or more motifs in terms of a Log-odds matrix and a set of sites that were used to make the motif.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_2082</uri><term>Matrix</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Convert a TRANSFAC 'matrix.dat' file into a MEME motif file suitable for use with MEME Suite programs.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_2082</uri><term>Matrix</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></input><output><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></output><note>Converts UNIPROBE matricies from standard input into a MEME motif file suitable for use with MEME Suite programs. Can be several matricies.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></input><output><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><note>This program converts a multiple alignment in clustalw format into a FASTA file.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></input><output><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format></output><note>This program converts a multiple alignment in ClustalW format into a PHYLIP file.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_0006</uri><term>Data</term></data></input><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></input><output><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><note>This program reads in a motif found by glam2, and writes it in a standard alignment format (FASTA-with-gaps or MSF). Choose to output sequences in FASTA-with-gaps or MSF. The output format depends on input parameter.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_0582</uri><term>Ontology</term></data><format><uri>http://edamontology.org/format_2196</uri><term>OBO format</term></format></input><output><data><uri>http://edamontology.org/data_0582</uri><term>Ontology</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></output><note>Convert a Gene Ontology OBO file into a GO DAG file.</note></function><function><operation><uri>http://edamontology.org/operation_3434</uri><term>Conversion</term></operation><input><data><uri>http://edamontology.org/data_0857</uri><term>Sequence search results</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format></input><output><data><uri>http://edamontology.org/data_0857</uri><term>Sequence search results</term></data><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output><note>Provides backwards compatibility by converting a mast xml file into a mast text file.</note></function><function><operation><uri>http://edamontology.org/operation_0233</uri><term>Sequence conversion</term></operation><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1966</uri><term>ASN.1 sequence format</term></format><format><uri>http://edamontology.org/format_1962</uri><term>strider format</term></format><format><uri>http://edamontology.org/format_1964</uri><term>plain text format (unformatted)</term></format><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format><format><uri>http://edamontology.org/format_1925</uri><term>codata</term></format><format><uri>http://edamontology.org/format_1935</uri><term>GCG</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1927</uri><term>EMBL format</term></format><format><uri>http://edamontology.org/format_1954</uri><term>Pearson format</term></format><format><uri>http://edamontology.org/format_1912</uri><term>Nexus format</term></format><format><uri>http://edamontology.org/format_1936</uri><term>GenBank format</term></format></input><output><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1948</uri><term>nbrf/pir</term></format><format><uri>http://edamontology.org/format_1925</uri><term>codata</term></format><format><uri>http://edamontology.org/format_1962</uri><term>strider format</term></format><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format><format><uri>http://edamontology.org/format_1935</uri><term>GCG</term></format><format><uri>http://edamontology.org/format_1997</uri><term>PHYLIP format</term></format><format><uri>http://edamontology.org/format_1934</uri><term>fitch program</term></format><format><uri>http://edamontology.org/format_1927</uri><term>EMBL format</term></format><format><uri>http://edamontology.org/format_1936</uri><term>GenBank format</term></format><format><uri>http://edamontology.org/format_1964</uri><term>plain text format (unformatted)</term></format><format><uri>http://edamontology.org/format_1912</uri><term>Nexus format</term></format><format><uri>http://edamontology.org/format_1954</uri><term>Pearson format</term></format><format><uri>http://edamontology.org/format_1966</uri><term>ASN.1 sequence format</term></format></output><note>Converts protein and DNA sequence formats.</note></function><function><operation><uri>http://edamontology.org/operation_2995</uri><term>Sequence classification</term></operation><input><data><uri>http://edamontology.org/data_2534</uri><term>Sequence attribute</term></data></input><output><data><uri>http://edamontology.org/data_1022</uri><term>Sequence feature label</term></data></output><note>Classify a string passed as a command line argument as an instance of the DNA or protein alphabet. The letters of an unknown alphabet. The program prints 'DNA' or 'PROTEIN' to standard output, depending on the value of the alphabet argument.</note></function><function><operation><uri>http://edamontology.org/operation_2238</uri><term>Statistical calculation</term></operation><input><data><uri>http://edamontology.org/data_3002</uri><term>Annotation track</term></data></input><output><data><uri>http://edamontology.org/data_0951</uri><term>Statistical estimate score</term></data></output><note>Read an AMA output file and output each sequence name, p-value and q-value. For each sequence in the input, outputs the sequence name, the p-value of the sequence and the q-value (minimum false discovery rate).</note></function><function><operation><uri>http://edamontology.org/operation_3480</uri><term>Probabilistic data generation</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><output><data><uri>http://edamontology.org/data_2968</uri><term>Image</term></data><format><uri>http://edamontology.org/format_3466</uri><term>EPS</term></format><format><uri>http://edamontology.org/format_3604</uri><term>svg</term></format></output><note>Create motif logos. A file containing one or more motifs in MEME format. Logo</note></function><function><operation><uri>http://edamontology.org/operation_2238</uri><term>Statistical calculation</term></operation><input><data><uri>http://edamontology.org/data_0006</uri><term>Data</term></data></input><input><data><uri>http://edamontology.org/data_2854</uri><term>Position-specific scoring matrix</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></input><output><data><uri>http://edamontology.org/data_0951</uri><term>Statistical estimate score</term></data></output><note>compute-prior-dist computes the distribution of priors from a file in MEME PSP format. Number of increments to scale the distribution into. The first two lines are the minimum and maximum priors. Each succeeding line contains the probability that a prior is in the bin.</note></function><function><operation><uri>http://edamontology.org/operation_2426</uri><term>Modelling and simulation</term></operation><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1940</uri><term>giFASTA format</term></format></input><output><data><uri>http://edamontology.org/data_1364</uri><term>Hidden Markov model</term></data></output><note>The program fasta-get-markov estimates a Markov model from a FASTA file of sequences.</note></function><function><operation><uri>http://edamontology.org/operation_1812</uri><term>Loading</term></operation><operation><uri>http://edamontology.org/operation_3096</uri><term>Editing</term></operation><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><note>Read and write FASTA files.</note></function><function><operation><uri>http://edamontology.org/operation_3429</uri><term>Generation</term></operation><input><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><note>Create a random subset of the sequences in a FASTA formatted file.</note></function><function><operation><uri>http://edamontology.org/operation_2238</uri><term>Statistical calculation</term></operation><input><data><uri>http://edamontology.org/data_1772</uri><term>Score</term></data></input><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data><format><uri>http://edamontology.org/format_1915</uri><term>Format</term></format></output><note>fitevd fits an extreme value distribution to a set of score-length pairs. Reads white-space separated score-length pairs from standard input.</note></function><function><operation><uri>http://edamontology.org/operation_0230</uri><term>Sequence generation</term></operation><output><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><note>gendb generates the specified number of sequences using a Markov model.</note></function><function><operation><uri>http://edamontology.org/operation_0236</uri><term>Sequence composition calculation</term></operation><input><data><uri>http://edamontology.org/data_0850</uri><term>Sequence set</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1255</uri><term>Sequence features</term></data></output><note>The program getsize prints statistics about the FASTA sequences.</note></function><function><operation><uri>http://edamontology.org/operation_0335</uri><term>Formatting</term></operation><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data></input><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data></output><note>This program masks a glam2 motif out of sequences, so that weaker motifs can be found. The GLAM2 motif to mask with 'x' in the sequences. The FASTA formatted sequences to mask. The input sequences are output with the GLAM2 motif sites masked out with 'x's.</note></function><function><operation><uri>http://edamontology.org/operation_0226</uri><term>Annotation</term></operation><input><data><uri>http://edamontology.org/data_0582</uri><term>Ontology</term></data></input><input><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format></input><output><data><uri>http://edamontology.org/data_2048</uri><term>Report</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format></output><note>Updates the GOMO XML file(s) to add details about the GO terms, such as their name, hierarchy, relative position in that hierarchy and which are implied by others in the significant terms for each motif. A file containing the heirarchy of the GO terms in the format specified here. An XML file from GOMO to update. The GOMO XML File is updated to contain details about the GO terms heirarchy.</note></function><function><operation><uri>http://edamontology.org/operation_0335</uri><term>Formatting</term></operation><input><data><uri>http://edamontology.org/data_0006</uri><term>Data</term></data></input><note>Easily rename MEME Suite HTML files to unique names incorporating the path name (rather than 'meme.html'). The program takes the names of one or more output directories created by MEME Suite programs such as MEME, CENTRIMO etc.</note></function><function><operation><uri>http://edamontology.org/operation_2238</uri><term>Statistical calculation</term></operation><input><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></input><input><data><uri>http://edamontology.org/data_1353</uri><term>Sequence motif</term></data><format><uri>http://edamontology.org/format_1360</uri><term>meme-motif</term></format></input><output><data><uri>http://edamontology.org/data_1772</uri><term>Score</term></data></output><note>This utility calculates the statistical power of a phylogenetic motif model. Each line of the output has the following: Motif ID score score FPR False Positive Rate TPR True Positive Rate</note></function><function><operation><uri>http://edamontology.org/operation_0238</uri><term>Sequence motif discovery</term></operation><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2854</uri><term>Position-specific scoring matrix</term></data><format><uri>http://edamontology.org/format_2200</uri><term>FASTA-like (text)</term></format></output><note>Generate position-specific priors from positive (likely to contain a feature of interest) and negative (unlikely to contain a feature of interest) sequences for use as an additional input to MEME. A file containing FASTA formatted sequences which are to be used as the primary set in PSP calculation. A file containing FASTA formatted sequences which are to be used as the control set in PSP calculation. A FASTA-like PSP format is written to standard output, it contains a prior for every position of every sequence in the primary set.</note></function><function><operation><uri>http://edamontology.org/operation_0369</uri><term>Sequence cutting</term></operation><input><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><note>Purge removes redundant sequences from a FASTA file. A file containing FASTA formatted sequences. This file will be overwritten. Purge overwrites the original FASTA sequence file with the purged sequences.</note></function><function><operation><uri>http://edamontology.org/operation_2238</uri><term>Statistical calculation</term></operation><input><data><uri>http://edamontology.org/data_1669</uri><term>P-value</term></data><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></input><output><data><uri>http://edamontology.org/data_0951</uri><term>Statistical estimate score</term></data></output><note>Takes as input a list of p-values and prints a corresponding list of q-values, computed using the method of Benjamini and Hochberg. A tab separated file containing a column of p-values. Other columns may exist Outputs tab-delimited columns.</note></function><function><operation><uri>http://edamontology.org/operation_2424</uri><term>Comparison</term></operation><operation><uri>http://edamontology.org/operation_0324</uri><term>Phylogenetic tree analysis</term></operation><input><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></input><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></input><output><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></output><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></output><note>Given a tree and an alignment, identify the intersection of the sets of sequence IDs and leaf labels. Trim the extra sequences and leaves and print the resulting alignment and tree.</note></function><function><operation><uri>http://edamontology.org/operation_3081</uri><term>Sequence alignment editing</term></operation><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></input><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data></output><note>Extract specified range of columns from an alignment. The extracted region of the sequence alignment is written to standard output.</note></function><function><operation><uri>http://edamontology.org/operation_3081</uri><term>Sequence alignment editing</term></operation><input><data><uri>http://edamontology.org/data_1045</uri><term>Species name</term></data></input><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></input><output><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data></output><note>Remove from an alignment all columns that contain a gap in the specified species. The name of a species present in the alignment for which gaps should be removed. The alignment, with the remaining columns that don't have gaps in the specified species, is written to standard output.</note></function><function><operation><uri>http://edamontology.org/operation_0327</uri><term>Phylogenetic footprinting / shadowing</term></operation><input><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></input><input><data><uri>http://edamontology.org/data_0863</uri><term>Sequence alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></input><output><data><uri>http://edamontology.org/data_2523</uri><term>Phylogenetic data</term></data><format><uri>http://edamontology.org/format_2332</uri><term>XML</term></format><format><uri>http://edamontology.org/format_2331</uri><term>HTML</term></format><format><uri>http://edamontology.org/format_2330</uri><term>Textual format</term></format></output><note>Perform phylogenetic shadowing on a given DNA alignment, using a given tree. This program is a simplified version of motiph, in which the equilibrium distribution is set equal to the background model, rather than being taken from a given motif. This tree may contain additional species not represented in the alignment.</note></function><documentation><url>http://meme-suite.org/doc/overview.html?man_type=web</url><type>User manual</type></documentation><publication><pmid>7584402</pmid></publication><publication><pmid>7584439</pmid></publication><publication><pmid>8877500</pmid></publication><publication><pmid>8902357</pmid></publication><publication><pmid>9283754</pmid></publication><publication><pmid>9366496</pmid></publication><publication><pmid>16845028</pmid></publication><publication><doi>10.1093/nar/gkp335</doi><pmid>19458158</pmid></publication><credit><name>MEME Suite Support</name><email>meme-suite@uw.edu</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>SPARSE</name><description>Very efficient structure-based alignment of RNAs.</description><homepage>http://www.bioinf.uni-freiburg.de/Software/SPARSE</homepage><biotoolsID>sparse</biotoolsID><biotoolsCURIE>biotools:sparse</biotoolsCURIE><version>1.8.9</version><toolType>Command-line tool</toolType><topic><uri>http://edamontology.org/topic_0097</uri><term>Nucleic acid structure analysis</term></topic><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Mac</operatingSystem><language>Python</language><license>GPL-3.0</license><collectionID>de.NBI</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0294</uri><term>Structure-based sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3495</uri><term>RNA sequence</term></data><format><uri>http://edamontology.org/format_2200</uri><term>FASTA-like (text)</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1916</uri><term>Alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_3508</uri><term>PDF</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><output><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></output><output><data><uri>http://edamontology.org/data_1465</uri><term>RNA structure</term></data><format><uri>http://edamontology.org/format_3466</uri><term>EPS</term></format></output><note>A simultaneous alignment and folding tool with quadratic complexity</note></function><documentation><url>http://www.bioinf.uni-freiburg.de/Software/SPARSE/</url><type>General</type></documentation><publication><doi>10.1093/bioinformatics/btv185</doi><pmid>25838465</pmid><pmcid>PMC4514930</pmcid><type>Primary</type></publication><credit><name>Milad Miladi</name><email>miladim@informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0002-0173-3009</orcidid><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Sebastian Will</name><typeRole>Contributor</typeRole></credit><credit><name>University Freiburg</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>rnateam</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeRole>Developer</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeRole>Developer</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>ExpaRNA-P</name><description>Simultaneous exact pattern matching and folding of RNAs.</description><homepage>http://www.bioinf.uni-freiburg.de/Software/ExpaRNA-P/</homepage><biotoolsID>exparna-p</biotoolsID><biotoolsCURIE>biotools:exparna-p</biotoolsCURIE><version>1.8.9</version><toolType>Command-line tool</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><topic><uri>http://edamontology.org/topic_0097</uri><term>Nucleic acid structure analysis</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Mac</operatingSystem><license>GPL-3.0</license><collectionID>de.NBI</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0294</uri><term>Structure-based sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3495</uri><term>RNA sequence</term></data><format><uri>http://edamontology.org/format_2200</uri><term>FASTA-like (text)</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1916</uri><term>Alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></output><output><data><uri>http://edamontology.org/data_2968</uri><term>Image</term></data><format><uri>http://edamontology.org/format_3466</uri><term>EPS</term></format></output><note>ExpaRNA is a fast, motif-based comparison and alignment tool for RNA molecules. It computes the best arrangement of local sequence-structure (substructure) motifs common to two RNAs.</note></function><documentation><url>http://www.bioinf.uni-freiburg.de/Software/ExpaRNA-P/</url><type>General</type></documentation><publication><doi>10.1186/s12859-014-0404-0</doi><pmid>25551362</pmid><pmcid>PMC4302096</pmcid><type>Primary</type></publication><credit><name>University Freiburg</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>rnateam</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeRole>Developer</typeRole></credit><credit><name>Christina Otto</name><email>schmiedc@informatik.uni-freiburg.de</email><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><name>Christina Otto</name><email>schmiedc@informatik.uni-freiburg.de</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>CARNA web server</name><description>Alignment of RNA structure ensembles.</description><homepage>http://rna.informatik.uni-freiburg.de/CARNA/</homepage><biotoolsID>carna</biotoolsID><biotoolsCURIE>biotools:carna</biotoolsCURIE><version>1.2.5</version><toolType>Web application</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><topic><uri>http://edamontology.org/topic_0097</uri><term>Nucleic acid structure analysis</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Windows</operatingSystem><operatingSystem>Mac</operatingSystem><collectionID>de.NBI</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0294</uri><term>Structure-based sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3495</uri><term>RNA sequence</term></data><format><uri>http://edamontology.org/format_2200</uri><term>FASTA-like (text)</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_2968</uri><term>Image</term></data><format><uri>http://edamontology.org/format_3547</uri><term>Image format</term></format><format><uri>http://edamontology.org/format_3466</uri><term>EPS</term></format><format><uri>http://edamontology.org/format_3508</uri><term>PDF</term></format></output><output><data><uri>http://edamontology.org/data_1916</uri><term>Alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format></output><output><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></output><output><data><uri>http://edamontology.org/data_2044</uri><term>Sequence</term></data><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><note>CARNA requires only the RNA sequences as input and will compute base pair probability matrices and align the sequences based on their full ensembles of structures.</note></function><documentation><url>http://rna.informatik.uni-freiburg.de/Help.jsp</url><type>General</type></documentation><publication><doi>10.1093/nar/gks491</doi><pmid>22689637</pmid><pmcid>PMC3394245</pmcid><type>Primary</type></publication><credit><name>University Freiburg</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>rnateam</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>LocARNA-P</name><description>Probabilistic structure-based multiple alignment of RNAs.</description><homepage>http://www.bioinf.uni-freiburg.de/Software/LocARNA/</homepage><biotoolsID>locarna-p</biotoolsID><biotoolsCURIE>biotools:locarna-p</biotoolsCURIE><version>1.8.9</version><toolType>Command-line tool</toolType><topic><uri>http://edamontology.org/topic_0080</uri><term>Sequence analysis</term></topic><topic><uri>http://edamontology.org/topic_0097</uri><term>Nucleic acid structure analysis</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Mac</operatingSystem><language>C++</language><collectionID>de.NBI</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0294</uri><term>Structure-based sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3495</uri><term>RNA sequence</term></data><format><uri>http://edamontology.org/format_2200</uri><term>FASTA-like (text)</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1916</uri><term>Alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_3508</uri><term>PDF</term></format></output><output><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></output><output><data><uri>http://edamontology.org/data_1465</uri><term>RNA structure</term></data><format><uri>http://edamontology.org/format_3466</uri><term>EPS</term></format></output><note>LocARNA simultaneously folds and aligns input sequences. Specifications of additional constraints or fixed input structures are possible.</note></function><documentation><url>http://www.bioinf.uni-freiburg.de/Software/LocARNA/</url><type>General</type></documentation><publication><doi>10.1261/rna.029041.111</doi><pmid>22450757</pmid><pmcid>PMC3334699</pmcid><type>Primary</type></publication><credit><name>University Freiburg</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>rnateam</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool><tool><name>LocARNA</name><description>Structure-based multiple alignment of RNAs.</description><homepage>http://www.bioinf.uni-freiburg.de/Software/LocARNA/</homepage><biotoolsID>locarna</biotoolsID><biotoolsCURIE>biotools:locarna</biotoolsCURIE><version>1.8.9</version><toolType>Command-line tool</toolType><topic><uri>http://edamontology.org/topic_0097</uri><term>Nucleic acid structure analysis</term></topic><operatingSystem>Linux</operatingSystem><operatingSystem>Mac</operatingSystem><language>C++</language><license>GPL-3.0</license><collectionID>de.NBI</collectionID><maturity>Mature</maturity><cost>Free of charge</cost><function><operation><uri>http://edamontology.org/operation_0294</uri><term>Structure-based sequence alignment</term></operation><input><data><uri>http://edamontology.org/data_3495</uri><term>RNA sequence</term></data><format><uri>http://edamontology.org/format_2200</uri><term>FASTA-like (text)</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></input><output><data><uri>http://edamontology.org/data_1916</uri><term>Alignment</term></data><format><uri>http://edamontology.org/format_1982</uri><term>ClustalW format</term></format><format><uri>http://edamontology.org/format_3508</uri><term>PDF</term></format><format><uri>http://edamontology.org/format_1929</uri><term>FASTA</term></format></output><output><data><uri>http://edamontology.org/data_0872</uri><term>Phylogenetic tree</term></data><format><uri>http://edamontology.org/format_1910</uri><term>newick</term></format></output><output><data><uri>http://edamontology.org/data_1465</uri><term>RNA structure</term></data><format><uri>http://edamontology.org/format_3466</uri><term>EPS</term></format></output><note>LocARNA simultaneously folds and aligns input sequences. Specifications of additional constraints or fixed input structures are possible.</note></function><documentation><url>https://github.com/s-will/LocARNA/blob/master/README</url><type>General</type></documentation><publication><doi>10.1371/journal.pcbi.0030065</doi><pmid>17432929</pmid><pmcid>PMC1851984</pmcid><type>Primary</type></publication><credit><name>University Freiburg</name><typeEntity>Institute</typeEntity><typeRole>Provider</typeRole></credit><credit><name>RNA tools and software consortium</name><typeEntity>Consortium</typeEntity><typeRole>Documentor</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeEntity>Person</typeEntity><typeRole>Developer</typeRole></credit><credit><name>Rolf Backofen</name><email>rna@rna.informatik.uni-freiburg.de</email><orcidid>http://orcid.org/0000-0001-8231-3323</orcidid><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit><credit><name>Sebastian Will</name><email>will@bioinf.uni-leipzig.de</email><typeEntity>Person</typeEntity><typeRole>Primary contact</typeRole></credit></tool></tools>