<?xml version='1.0'?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:georss="http://www.georss.org/georss" xmlns:atom="http://www.w3.org/2005/Atom" >
<channel>
	<title><![CDATA[BOL: Related items]]></title>
	<link>https://bioinformaticsonline.com/related/38735?offset=590</link>
	<atom:link href="https://bioinformaticsonline.com/related/38735?offset=590" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</guid>
	<pubDate>Sat, 06 Jul 2024 04:29:16 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44595/squeezemeta-a-fully-automated-metagenomics-pipeline-from-reads-to-bins</link>
	<title><![CDATA[SqueezeMeta: a fully automated metagenomics pipeline, from reads to bins]]></title>
	<description><![CDATA[<p dir="auto">SqueezeMeta is a full automatic pipeline for metagenomics/metatranscriptomics, covering all steps of the analysis. SqueezeMeta includes multi-metagenome support allowing the co-assembly of related metagenomes and the retrieval of individual genomes via binning procedures. Thus, SqueezeMeta features several unique characteristics:</p>
<ol dir="auto">
<li>Co-assembly procedure with read mapping for estimation of the abundances of genes in each metagenome</li>
<li>Co-assembly of a large number of metagenomes via merging of individual metagenomes</li>
<li>Includes binning and bin checking, for retrieving individual genomes</li>
<li>The results are stored in a database, where they can be easily exported and shared, and can be inspected anywhere using a web interface.</li>
<li>Internal checks for the assembly and binning steps inform about the consistency of contigs and bins, allowing to spot potential chimeras.</li>
<li>Metatranscriptomic support via mapping of cDNA reads against reference metagenomes</li>
</ol><p>Address of the bookmark: <a href="https://github.com/jtamames/SqueezeMeta" rel="nofollow">https://github.com/jtamames/SqueezeMeta</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</guid>
	<pubDate>Tue, 10 May 2016 08:10:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27261/segemehl</link>
	<title><![CDATA[segemehl]]></title>
	<description><![CDATA[<p><span>segemehl is a software to map short sequencer reads to reference genomes. Unlike other methods, segemehl is able to detect not only mismatches but also insertions and deletions. Furthermore, segemehl is not limited to a specific read length and is able to map&nbsp;primer- or polyadenylation contaminated reads correctly.&nbsp; segemehl implements a matching strategy based on enhanced suffix arrays (ESA).&nbsp;</span></p>
<p><span>More at&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/</span></p>
<p><span>Manual&nbsp;http://www.bioinf.uni-leipzig.de/Software/segemehl/segemehl_manual_0_1_7.pdf</span></p><p>Address of the bookmark: <a href="http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html" rel="nofollow">http://hoffmann.bioinf.uni-leipzig.de/LIFE/segemehl.html</a></p>]]></description>
	<dc:creator>Anjana</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</guid>
	<pubDate>Wed, 15 Jun 2016 18:08:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/27841/covcal-coverage-read-count-calculator</link>
	<title><![CDATA[CovCal: Coverage / Read Count Calculator]]></title>
	<description><![CDATA[<h2>Coverage / Read Count Calculator</h2>
<h4>Calculate how much sequencing you need to hit a target depth of coverage (or vice versa).</h4>
<p><span>Instructions:</span> set the read length/configuration and genome size, then select what you want to calculate.</p>
<p>Written by <a href="http://stephenturner.us/" target="blank">Stephen Turner</a>, based on the <a href="http://www.ncbi.nlm.nih.gov/pubmed/3294162" target="_blank">Lander-Waterman formula</a>, inspired by <a href="http://core-genomics.blogspot.com/2016/05/how-many-reads-to-sequence-genome.html" target="_blank">a similar calculator</a> written by James Hadfield. Coverage is calculated as <em>C=LN/G</em> and reads as <em>N=CG/L</em> where <em>C</em> = Coverage (X),<em>L</em> = Read length (bp), <em>G</em> = Haploid genome size (bp), and <em>N</em> = Number of reads. Source code <a href="https://github.com/stephenturner/covcalc" target="_blank">on GitHub</a>.</p><p>Address of the bookmark: <a href="http://apps.bioconnector.virginia.edu/covcalc/" rel="nofollow">http://apps.bioconnector.virginia.edu/covcalc/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30557/speedseq</guid>
	<pubDate>Fri, 20 Jan 2017 06:05:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30557/speedseq</link>
	<title><![CDATA[SpeedSeq]]></title>
	<description><![CDATA[<p>A flexible framework for rapid genome analysis and interpretation</p>
<p>C Chiang, R M Layer, G G Faust, M R Lindberg, D B Rose, E P Garrison, G T Marth, A R Quinlan, and I M Hall. SpeedSeq: ultra-fast personal genome analysis and interpretation. Nat Meth (2015). doi:10.1038/nmeth.3505.</p>
<p><a href="http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html">http://www.nature.com/nmeth/journal/vaop/ncurrent/full/nmeth.3505.html</a></p><p>Address of the bookmark: <a href="https://github.com/hall-lab/speedseq" rel="nofollow">https://github.com/hall-lab/speedseq</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</guid>
	<pubDate>Tue, 04 Feb 2020 23:26:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40893/quorum-an-error-corrector-for-illumina-reads</link>
	<title><![CDATA[QuorUM: An Error Corrector for Illumina Reads]]></title>
	<description><![CDATA[<p><span>We produce trimmed and error-corrected reads that result in assemblies with longer contigs and fewer errors. We compared QuorUM against several published error correctors and found that it is the best performer in most metrics we use. QuorUM is efficiently implemented making use of current multi-core computing architectures and it is suitable for large data sets (1 billion bases checked and corrected per day per core)</span></p><p>Address of the bookmark: <a href="http://www.genome.umd.edu/" rel="nofollow">http://www.genome.umd.edu/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44758/the-ifs-and-buts-of-ngs-quality-control-and-trimming</guid>
	<pubDate>Thu, 02 Jan 2025 20:11:07 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44758/the-ifs-and-buts-of-ngs-quality-control-and-trimming</link>
	<title><![CDATA[The &quot;Ifs&quot; and &quot;Buts&quot; of NGS Quality Control and Trimming]]></title>
	<description><![CDATA[<p>Next-Generation Sequencing (NGS) has revolutionized biological research, providing vast amounts of data for a wide range of applications. However, the reliability of NGS analyses heavily depends on the quality of raw sequencing data. Quality control (QC) and trimming are critical preprocessing steps that can make or break your downstream analyses. In this blog, we explore the "ifs" (why you should perform QC and trimming) and the "buts" (challenges or considerations) of this vital step in NGS workflows.</p><h3><strong>The "Ifs" of NGS QC and Trimming</strong></h3><ol>
<li>
<p><strong>Ensures Data Integrity</strong><br />If you want to minimize errors in downstream analyses, QC and trimming remove low-quality reads and bases, ensuring high-confidence data. This step is essential for reliable variant calling, assembly, and other applications.</p>
</li>
<li>
<p><strong>Removes Contaminants</strong><br />If adapter sequences or contaminants are present in the raw reads, trimming can eliminate them. This prevents issues like misalignment or incorrect biological interpretations, ensuring cleaner data for analysis.</p>
</li>
<li>
<p><strong>Improves Mapping and Assembly</strong><br />If your goal is better alignment to a reference genome or improved de novo assembly, trimming low-quality bases and adapters is critical. High-quality reads map more efficiently and generate more accurate assemblies.</p>
</li>
<li>
<p><strong>Reduces Computational Load</strong><br />If you want to save computational resources, trimming reduces the dataset size, which speeds up processing and analysis. Clean datasets mean less computational time spent on processing low-quality data.</p>
</li>
<li>
<p><strong>Prepares for Standardized Analyses</strong><br />If your project involves multiple datasets, QC and trimming ensure uniformity across them. This standardization makes comparisons valid and reproducible, particularly in large collaborative studies.</p>
</li>
</ol><h3><strong>The "Buts" of NGS QC and Trimming</strong></h3><ol>
<li>
<p><strong>Risk of Over-Trimming</strong><br />But excessive trimming can lead to the loss of informative sequences, reducing read depth and potentially discarding biologically relevant data. This is especially critical in studies with limited sequencing depth.</p>
</li>
<li>
<p><strong>Bias Introduction</strong><br />But trimming algorithms might introduce biases, especially if they inadvertently remove sequences with specific biological patterns. This can skew results and compromise biological insights.</p>
</li>
<li>
<p><strong>Loss of Context in Paired-End Reads</strong><br />But trimming one read in a pair more than the other can lead to loss of pairing information. This complicates downstream analyses that rely on paired-end data, such as structural variant detection.</p>
</li>
<li>
<p><strong>Time and Resource Intensive</strong><br />But running QC and trimming for large datasets can be computationally expensive and time-consuming. As sequencing depth increases, preprocessing becomes a bottleneck in the analysis pipeline.</p>
</li>
<li>
<p><strong>Variable Standards</strong><br />But the criteria for trimming (e.g., quality threshold, minimum read length) can vary between tools and datasets. This variability may affect reproducibility and comparability of results across studies.</p>
</li>
</ol><h3><strong>Balancing the "Ifs" and "Buts"</strong></h3><p>To maximize the benefits of QC and trimming while mitigating the challenges, consider the following best practices:</p><ul>
<li>
<p><strong>Use QC Tools Wisely:</strong> Start with tools like <strong>FastQC</strong> to identify quality issues in your raw data. Visualizing quality metrics helps tailor your trimming parameters.</p>
</li>
<li>
<p><strong>Choose Reliable Trimming Tools:</strong> Tools like <strong>Trimmomatic</strong>, <strong>Cutadapt</strong>, and <strong>BBduk</strong> offer adaptive and customizable trimming options. Select one that aligns with your dataset and project goals.</p>
</li>
<li>
<p><strong>Set Reasonable Parameters:</strong> Avoid over-trimming by setting quality thresholds and minimum read lengths that balance data retention and quality improvement.</p>
</li>
<li>
<p><strong>Test Downstream Effects:</strong> Validate the impact of QC and trimming on downstream analyses, such as alignment efficiency, variant calling accuracy, or assembly quality.</p>
</li>
<li>
<p><strong>Document Your Workflow:</strong> Maintain detailed records of the parameters and tools used for QC and trimming. This ensures reproducibility and enables better troubleshooting.</p>
</li>
</ul><h3><strong>Conclusion</strong></h3><p>NGS quality control and trimming are essential steps to ensure reliable and accurate data for analysis. While the "ifs" highlight the clear benefits of these steps, the "buts" remind us of the potential pitfalls. By adopting best practices and carefully balancing these considerations, you can optimize your preprocessing workflow and unlock the full potential of your sequencing data.</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38310/sisrs-site-identification-from-short-read-sequences</guid>
	<pubDate>Wed, 28 Nov 2018 08:56:03 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38310/sisrs-site-identification-from-short-read-sequences</link>
	<title><![CDATA[SISRS: Site Identification from Short Read Sequences]]></title>
	<description><![CDATA[<p>Next-gen sequence data such as Illumina HiSeq reads. Data must be sorted into folders by taxon (e.g. species or genus). Paired reads in fastq format must be specified by _R1 and _R2 in the (otherwise identical) filenames. Paired and unpaired reads must have a fastq file extension.</p><p>Address of the bookmark: <a href="https://github.com/rachelss/SISRS" rel="nofollow">https://github.com/rachelss/SISRS</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/923/phylogenetic-for-bioinformatics</guid>
	<pubDate>Tue, 16 Jul 2013 03:50:30 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/923/phylogenetic-for-bioinformatics</link>
	<title><![CDATA[Phylogenetic for Bioinformatics]]></title>
	<description><![CDATA[<p>Biologists estimate that there are about 5 to 100 million species of organisms living on Earth today. Evidence from morphological, biochemical, and gene sequence data suggests that all organisms on Earth are genetically related, and the genealogical relationships of living things can be represented by a vast evolutionary tree, the Tree of Life. The Tree of Life then represents the phylogeny of organisms, i. e., the history of organismal lineages as they change through time.<br />Every living organism contains DNA, RNA, and proteins. Closely related organisms generally have a high degree of agreement in the molecular structure of these substances, while the molecules of organisms distantly related usually show a pattern of dissimilarity. Molecular phylogeny uses such data to build a "relationship tree" that shows the probable evolution of various organisms. Not until recent decades, however, has it been possible to isolate and identify these molecular structures.&nbsp;<br />phylogenetics is the study of evolutionary relatedness among various groups of organisms (for example, species or populations), which is discovered through molecular sequencing data and morphological data matrices. In other word, Phylogenetics, the science of phylogeny, is one part of the larger field of systematics, which also includes taxonomy. Taxonomy is the science of naming and classifying the diversity of organisms Molecular phylogeny is the use of the structure of molecules to gain information on an organism's evolutionary relationships. The result of a molecular phylogenetic analysis is expressed in a so-called phylogenetic tree.</p><p>The evolutionary connections between organisms are represented graphically through phylogenetic trees. Due to the fact that evolution takes place over long periods of time that cannot be observed directly, biologists must reconstruct phylogenies by inferring the evolutionary relationships among present-day organisms.&nbsp;<br />Application of the techniques that make this possible can be seen in the very limited field of human genetics, such as the ever more popular use of genetic testing to determine a child's paternity, as well as the emergence of a new branch of criminal forensics focused on genetic evidence.<br />The effect on traditional scientific classification schemes in the biological sciences has been dramatic as well. Work that was once immensely labor- and materials-intensive can now be done quickly and easily, leading to yet another source of information becoming available for systematic and taxonomic appraisal. This particular kind of data has become so popular that taxonomical schemes based solely on molecular data may be encountered. Proponents even claim that taxonomy was previously based on morphology alone, which of course is utter fable.<br /><br /><strong>For additional information on phylogenetics, see list of Phylogenetics Resources on the Internet.</strong></p><p>Phylogeny and Reconstructing Phylogenetic Trees:&nbsp;<a href="http://aleph0.clarku.edu/~djoyce/java/Phyltree/cover.html"></a><a href="http://aleph0.clarku.edu/~djoyce/java/Phyltree/cover.html">http://aleph0.clarku.edu/~djoyce/java/Phyltree/cover.html</a><br />the CBRG and Department of Statistics Phylogeny tutorial:&nbsp;<a href="http://www.compbio.ox.ac.uk/tutorials/phylogeny/"></a><a href="http://www.compbio.ox.ac.uk/tutorials/phylogeny/">http://www.compbio.ox.ac.uk/tutorials/phylogeny/</a><br />TUTORIAL: PHYLOGENETIC ANALYSIS USING PARSIMONY:<a href="http://home.cc.umanitoba.ca/~psgendb/GDE/phylogeny/parsimony/phylip.parsimony.html"></a><a href="http://home.cc.umanitoba.ca/~psgendb/GDE/phylogeny/parsimony/phylip.parsimony.html">http://home.cc.umanitoba.ca/~psgendb/GDE/phylogeny/parsimony/phylip.parsimony.html</a></p><p>PHYLIP:&nbsp;<a href="http://www.umanitoba.ca/afs/plant_science/psgendb/doc/Phylip/main.html"></a><a href="http://www.umanitoba.ca/afs/plant_science/psgendb/doc/Phylip/main.html">http://www.umanitoba.ca/afs/plant_science/psgendb/doc/Phylip/main.html</a><br />An Introduction to Molecular Phylogeny:&nbsp;<a href="http://bibiserv.techfak.uni-bielefeld.de/gcb04/tutorials/hoef-emden/GCB04Tut.pdf"></a><a href="http://bibiserv.techfak.uni-bielefeld.de/gcb04/tutorials/hoef-emden/GCB04Tut.pdf">http://bibiserv.techfak.uni-bielefeld.de/gcb04/tutorials/hoef-emden/GCB04Tut.pdf</a></p><p>How to make a phylogenetic tree:&nbsp;<a href="http://www.hiv.lanl.gov/content/sequence/TUTORIALS/TREE_TUTORIAL/Tree"></a><a href="http://www.hiv.lanl.gov/content/sequence/TUTORIALS/TREE_TUTORIAL/Tree">http://www.hiv.lanl.gov/content/sequence/TUTORIALS/TREE_TUTORIAL/Tree</a>tutorial.html<br />Phylogenetic Trees:&nbsp;<a href="http://cnx.org/content/m11052/latest/"></a><a href="http://cnx.org/content/m11052/latest/">http://cnx.org/content/m11052/latest/</a><br />Phylogeny by Ron Shamir:&nbsp;<a href="http://www.cs.tau.ac.il/~rshamir/algmb/01/scribe08/lec08.pdf"></a><a href="http://www.cs.tau.ac.il/~rshamir/algmb/01/scribe08/lec08.pdf">http://www.cs.tau.ac.il/~rshamir/algmb/01/scribe08/lec08.pdf</a><br />Introduction to Phylogeny:&nbsp;<a href="http://www.utm.edu/departments/cens/biology/rirwin/391/391Phylog.htm"></a><a href="http://www.utm.edu/departments/cens/biology/rirwin/391/391Phylog.htm">http://www.utm.edu/departments/cens/biology/rirwin/391/391Phylog.htm</a><br />Lecturer notes on Phylogeny:&nbsp;<a href="http://www.sbc.su.se/~bens/course_material/phylocourse1/lecture2.pdf"></a><a href="http://www.sbc.su.se/~bens/course_material/phylocourse1/lecture2.pdf">http://www.sbc.su.se/~bens/course_material/phylocourse1/lecture2.pdf</a><br />Principles and Practice of Phylogenetic Systematics:<a href="http://www.faculty.biol.ttu.edu/Strauss/Phylogenetics/LectureNotes.htm"></a><a href="http://www.faculty.biol.ttu.edu/Strauss/Phylogenetics/LectureNotes.htm">http://www.faculty.biol.ttu.edu/Strauss/Phylogenetics/LectureNotes.htm</a></p><p>Inferring phylogenetic trees:&nbsp;<a href="http://www.cis.hut.fi/Opinnot/T-61.6070/slides2008/pres_6070.pdf"></a><a href="http://www.cis.hut.fi/Opinnot/T-61.6070/slides2008/pres_6070.pdf">http://www.cis.hut.fi/Opinnot/T-61.6070/slides2008/pres_6070.pdf</a></p><p><strong>Lecture Notes</strong></p><p>Chapter 1 - The Diversity, Classification, and Evolution of Vertebrates:<a href="http://academic.emporia.edu/mooredwi/nathist/chap1.htm"></a><a href="http://academic.emporia.edu/mooredwi/nathist/chap1.htm">http://academic.emporia.edu/mooredwi/nathist/chap1.htm</a></p><p>Algorithms for Phylogenetic Reconstructions:<a href="http://lectures.molgen.mpg.de/Algorithmische_Bioinformatik_WS0405/phylogeny_script.pdf"></a><a href="http://lectures.molgen.mpg.de/Algorithmische_Bioinformatik_WS0405/phylogeny_script.pdf">http://lectures.molgen.mpg.de/Algorithmische_Bioinformatik_WS0405/phylogeny_script.pdf</a></p><p>Phylogeny.fr is a free, simple to use web service dedicated to reconstructing and analysing phylogenetic relationships between molecular sequences. Phylogeny.fr runs and connects various bioinformatics programs to reconstruct a robust phylogenetic tree from a set of sequences. For more detail :&nbsp;<a href="http://www.phylogeny.fr/version2_cgi/index.cgi"></a><a href="http://www.phylogeny.fr/version2_cgi/index.cgi">http://www.phylogeny.fr/version2_cgi/index.cgi</a></p><p>A Brief Tutorial on Phylogenetics<br /><a href="http://bioss.ac.uk/~dirk/talks/tutorial_phylogenetics.pdf"></a><a href="http://bioss.ac.uk/~dirk/talks/tutorial_phylogenetics.pdf">http://bioss.ac.uk/~dirk/talks/tutorial_phylogenetics.pdf</a></p><p>A Brief Tutorial on Phylogenetics Human Rabbit Chicken<br /><a href="http://bioss.ac.uk/~dirk/talks/psnup_tutorial_phylogenetics.pdf"></a><a href="http://bioss.ac.uk/~dirk/talks/psnup_tutorial_phylogenetics.pdf">http://bioss.ac.uk/~dirk/talks/psnup_tutorial_phylogenetics.pdf</a></p><p>Phylogenetic Tree Computation Tutorial Overview<br /><a href="http://pga.lbl.gov/Workshop/April2002/lectures/Olken.pdf"></a><a href="http://pga.lbl.gov/Workshop/April2002/lectures/Olken.pdf">http://pga.lbl.gov/Workshop/April2002/lectures/Olken.pdf</a></p><p>MrBayes: A program for the Bayesian inference of phylogeny<br /><a href="http://golab.unl.edu/teaching/SBseminar/manual.pdf"></a><a href="http://golab.unl.edu/teaching/SBseminar/manual.pdf">http://golab.unl.edu/teaching/SBseminar/manual.pdf</a></p><p><strong>Web sites providing software for the construction of phylogenetic trees</strong></p><ul>
<li><a href="http://www.mbio.ncsu.edu/BioEdit/bioedit.html">BioEdit</a></li>
</ul><ul>
<li><a href="http://www.dinofish.com/">Coelocanth-Fish Out of Time</a></li>
</ul><ul>
<li><a href="http://cbrg.inf.ethz.ch/">Computational Biochemistry Research Group</a></li>
</ul><ul>
<li><a href="http://www.geocities.com/RainForest/Vines/8695/software.html">Digital Taxonomy</a></li>
</ul><ul>
<li><a href="http://www.cladistics.org/education/hennig86.html">Hennig 86</a></li>
</ul><ul>
<li><a href="http://www.bioinformaticssolutions.com/">Hyperclean</a>&nbsp;from Bioinformatics Solutions, Inc.</li>
</ul><ul>
<li><a href="http://www.mun.ca/biology/scarr/Directory.html">Memorial University of Newfoundland</a></li>
</ul><ul>
<li><a href="http://morphbank.ebc.uu.se/mrbayes/">Mr. Bayes</a></li>
</ul><ul>
<li><a href="http://www.cladistics.com/about_nona.htm">NONA</a></li>
</ul><ul>
<li><a href="http://evolve.zoo.ox.ac.uk/">Oxford University Evolutionary Biology Group</a></li>
</ul><ul>
<li><a href="http://flatpebble.nceas.ucsb.edu/public/">Paleobiology Database</a></li>
</ul><ul>
<li><a href="http://paup.csit.fsu.edu/index.html">PAUP</a></li>
</ul><ul>
<li><a href="http://evolution.genetics.washington.edu/phylip.html">Phylip Homepage</a></li>
</ul><ul>
<li><a href="http://research.amnh.org/scicomp/projects/poy.php">Poy</a></li>
</ul><ul>
<li><a href="http://www.sinauer.com/">Sinauer Associates</a></li>
</ul><ul>
<li><a href="http://www.cladistics.org/downloads/webtnt.html">TNT</a>-Tree Analysis Using New Technology</li>
</ul><ul>
<li><a href="http://www.treebase.org/treebase/index.html">Tree Base</a></li>
</ul><ul>
<li><a href="http://www.treefinder.de/">Treefinder</a></li>
</ul><ul>
<li><a href="http://www.tree-puzzle.de/">Tree-Puzzle</a></li>
</ul><ul>
<li><a href="http://taxonomy.zoology.gla.ac.uk/rod/treeview.html">Tree View</a>-Taxonomy and Systematics Group at Glasgow</li>
</ul><ul>
<li><a href="http://evolution.genetics.washington.edu/phylip/software.html">Washington University</a>-List of Phylogeny Software</li>
</ul>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/3013/python-and-biopython-tutorial</guid>
	<pubDate>Fri, 23 Aug 2013 06:47:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/3013/python-and-biopython-tutorial</link>
	<title><![CDATA[Python and BioPython Tutorial]]></title>
	<description><![CDATA[<p>A quickstart tutorial that allows to become familiar with the Python language. The exercises expect knowledge of basic concepts of programming. A group of 2nd year computer science students with no previous Python knowledge required 60'-90' to complete the exercises. With about 3 hours time, the exercise is suitable for non-programmers as well.</p><p>Address of the bookmark: <a href="http://www.biotnet.org/training-materials/python-programmers" rel="nofollow">http://www.biotnet.org/training-materials/python-programmers</a></p>]]></description>
	<dc:creator>Manshi Raghubanshi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/4037/perl-and-bioperl-tutorials</guid>
	<pubDate>Wed, 28 Aug 2013 05:51:38 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/4037/perl-and-bioperl-tutorials</link>
	<title><![CDATA[Perl and BioPerl Tutorials]]></title>
	<description><![CDATA[<p>This bookmark is created to store the useful Perl and BioPerl tutorial links at one place. Feel free to share and add more useful tutorial links here ....&nbsp;</p>
<p>&nbsp;</p><p>Address of the bookmark: <a href="http://cbb.sjtu.edu.cn/course/database/beginning.pdf" rel="nofollow">http://cbb.sjtu.edu.cn/course/database/beginning.pdf</a></p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>

</channel>
</rss>