jMOTU Barcode DNA sequence data analysis made easy.
Download

jMOTU Ranking & Summary

jMOTU Tags

analysis Analyze Read DNA sequence DNA analysis convert DNA sequence stretching DNA analysis read DNA sequence DNA sequence reader analyze DNA sequence edit DNA sequence DNA sequence editor view DNA sequence DNA sequence analysis view DNA data display DNA data DNA data sequence alignment data data sequence DNA sequence analyzer align DNA sequence compare DNA sequence DNA data set analysis DNA Fingerprint Data DNA Sequence Manipulation aligned DNA sequence data Genomic DNA sequence sequence data viewer convert DNA data data sequence visualization compress DNA sequence DNA sequence compression encode DNA sequence DNA sequence compressor database sequence analysis DNA sequence data read input sequences search sequence data sequence data searcher sequence data analysis analyze DNA sequence data DNA sequence data analysis analyse DNA sequence view DNA methylation data view sequence data analyze sequence data sequence data analyzer sequence file analysis analyse sequence data sequence data DNA methylation analysis DNA sequence visualization sequence data control multiple sequence analysis DNA sequence evolution DNA restriction analysis

jMOTU Description

jMOTU is a handy, easy to use package specially designed to help you cluster barcode DNA sequence data into molecular operational taxonomic units (MOTU). If you are not sure what a MOTU is, please see the DNA Barcoding pages on our website. jMOTU does the following: · reads input sequences in FASTA or NEXUS format · calculates distances between pairs of sequences using a combination of BLAST and the Needleman-Wunch exact global alignment algorithm · clusters input sequences into MOTU using various cutoff measures jMOTU can process large datasets and uses a series of filtering steps to minimise the number of exact global alignments that must be performed. When calculating pairwise distances, jMOTU ignores gaps and counts only nucleotide mis-matches, making it relatively robust to sequencing errors caused by homopolymer runs. Clustering is carried out using a greedy algorithm that is not dependent on input sequence order. JMOTU has been tested on raw datasets of around 50,000 input sequences, and can cluster larger datasets by preforming preclustering of subsets of data before combining them for a global analysis.

jMOTU Related Software