<?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/19636?offset=920</link>
	<atom:link href="https://bioinformaticsonline.com/related/19636?offset=920" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43799/kast</guid>
	<pubDate>Wed, 23 Feb 2022 08:28:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43799/kast</link>
	<title><![CDATA[KAST]]></title>
	<description><![CDATA[<p><span>Perform Alignment-free k-tuple frequency comparisons from sequences. This can be in the form of two input files (e.g. a reference and a query) or a single file for pairwise comparisons to be made.</span></p><p>Address of the bookmark: <a href="https://github.com/martinjvickers/KAST" rel="nofollow">https://github.com/martinjvickers/KAST</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44223/ale-assembly-likelihood-estimator</guid>
	<pubDate>Wed, 08 Mar 2023 01:39:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44223/ale-assembly-likelihood-estimator</link>
	<title><![CDATA[ALE: Assembly Likelihood Estimator]]></title>
	<description><![CDATA[<p>Just import the assembly, bam and ALE scores. You can convert the .ale file to a set of .wig files with ale2wiggle.py and IGV can read those directly.&nbsp; Depending on your genome size you may want to convert the .wig files to the BigWig format.</p><p>Address of the bookmark: <a href="https://github.com/sc932/ALE" rel="nofollow">https://github.com/sc932/ALE</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</guid>
	<pubDate>Thu, 31 Aug 2023 02:43:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44371/steps-to-find-all-the-repeats-in-the-genome</link>
	<title><![CDATA[Steps to find all the repeats in the genome !]]></title>
	<description><![CDATA[<div><p>To find repeats in a genome from 2 to 9 length using a Perl script, you can use the RepeatMasker tool with the "--length" option<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. Here's a step-by-step guide:</p></div><div><ol>
<li>Install RepeatMasker: First, you need to install RepeatMasker on your system. You can download it from the RepeatMasker website<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
</ol></div><div><ol>
<li>Prepare the genome sequence: Make sure you have the genome sequence in a FASTA file format. Let's assume the file is named "genome.fasta".</li>
</ol><blockquote><p>./RepeatMasker -pa &lt;number_of_processors&gt; -nolow -norna -no_is -div &lt;divergence_value&gt; -lib RepeatMaskerLib.embl -gff -xsmall -small -poly -species &lt;species_name&gt; -dir &lt;output_directory&gt; -length &lt;min_length&gt;-&lt;max_length&gt; genome.fasta</p></blockquote><div><p>Replace the following placeholders with appropriate values:</p><ul>
<li><code>&lt;number_of_processors&gt;</code>: The number of processors/threads you want to use for parallel processing.</li>
<li><code>&lt;divergence_value&gt;</code>: The divergence value for the species you are analyzing. You can find divergence values for different species in the RepeatMasker documentation<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>.</li>
<li><code>&lt;species_name&gt;</code>: The name of the species you are analyzing.</li>
<li><code>&lt;output_directory&gt;</code>: The directory where you want the output files to be saved.</li>
<li><code>&lt;min_length&gt;</code>&nbsp;and&nbsp;<code>&lt;max_length&gt;</code>: The minimum and maximum lengths of the repeats you want to find (in this case, 2 and 9).</li>
</ul></div><div><ol>
<li>Analyze the output: RepeatMasker will generate several output files, including a .out file. You can parse this file to extract the information you need. There is a Perl tool called "one_code_to_find_them_all.pl" that can help you parse RepeatMasker output files<a href="https://mobilednajournal.biomedcentral.com/articles/10.1186/1759-8753-5-13" target="_blank">[0]</a>. You can download it from the source provided.</li>
</ol></div><div><ol>
<li>Use the provided Perl script: Once you have the "one_code_to_find_them_all.pl" script, you can run it to conveniently parse the RepeatMasker output files. Here's an example of how to use it:</li>
</ol><blockquote><p>perl one_code_to_find_them_all.pl --rm &lt;RepeatMasker_out_file&gt; --length &lt;length_file&gt;</p></blockquote></div><p>&nbsp;</p></div><div><div><p>Replace&nbsp;<code>&lt;RepeatMasker_out_file&gt;</code>&nbsp;with the path to your RepeatMasker .out file, and&nbsp;<code>&lt;length_file&gt;</code>&nbsp;with the path to a file containing the lengths of the reference elements.</p></div><div><p>This script will generate several output files, including .log.txt and .copynumber.csv, which contain quantitative information about the identified repeat elements.</p></div><div><p>Remember to adjust the parameters and options according to your specific needs and the characteristics of your genome.</p></div></div>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/44637/tools-to-access-the-quality-of-your-assembled-genome</guid>
	<pubDate>Thu, 08 Aug 2024 23:31:18 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/44637/tools-to-access-the-quality-of-your-assembled-genome</link>
	<title><![CDATA[Tools to access the quality of your assembled genome !]]></title>
	<description><![CDATA[<ul dir="auto">
<li><a href="https://github.com/linsalrob/fasta_validator">FASTA VALIDATOR</a>&nbsp;+&nbsp;<a href="https://github.com/shenwei356/seqkit">SEQKIT RMDUP</a>: FASTA validation</li>
<li><a href="https://genometools.org/tools/gt_gff3validator.html">GENOMETOOLS GT GFF3VALIDATOR</a>: GFF3 validation</li>
<li><a href="https://github.com/PlantandFoodResearch/assemblathon2-analysis/blob/a93cba25d847434f7eadc04e63b58c567c46a56d/assemblathon_stats.pl">ASSEMBLATHON STATS</a>: Assembly statistics</li>
<li><a href="https://genometools.org/tools/gt_stat.html">GENOMETOOLS GT STAT</a>: Annotation statistics</li>
<li><a href="https://github.com/ncbi/fcs">NCBI FCS ADAPTOR</a>: Adaptor contamination pass/fail</li>
<li><a href="https://github.com/ncbi/fcs">NCBI FCS GX</a>: Foreign organism contamination pass/fail</li>
<li><a href="https://gitlab.com/ezlab/busco">BUSCO</a>: Gene-space completeness estimation</li>
<li><a href="https://github.com/tolkit/telomeric-identifier">TIDK</a>: Telomere repeat identification</li>
<li><a href="https://github.com/oushujun/LTR_retriever/blob/master/LAI">LAI</a>: Continuity of repetitive sequences</li>
<li><a href="https://github.com/DerrickWood/kraken2">KRAKEN2</a>: Taxonomy classification</li>
<li><a href="https://github.com/igvteam/juicebox.js">HIC CONTACT MAP</a>: Alignment and visualisation of HiC data</li>
<li><a href="https://github.com/mummer4/mummer">MUMMER</a>&nbsp;&rarr;&nbsp;<a href="http://circos.ca/documentation/">CIRCOS</a>&nbsp;+&nbsp;<a href="https://plotly.com/">DOTPLOT</a>&nbsp;&amp;&nbsp;<a href="https://github.com/lh3/minimap2">MINIMAP2</a>&nbsp;&rarr;&nbsp;<a href="https://github.com/schneebergerlab/plotsr">PLOTSR</a>: Synteny analysis</li>
<li><a href="https://github.com/marbl/merqury">MERQURY</a>: K-mer completeness, consensus quality and phasing assessment</li>
</ul>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</guid>
	<pubDate>Fri, 31 Jan 2025 12:47:43 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44766/genome-simulation-with-slim-and-msprime</link>
	<title><![CDATA[Genome Simulation with SLiM and msprime]]></title>
	<description><![CDATA[<p>Genome simulation is an essential tool in population genetics, enabling researchers to model evolutionary processes and study genetic variation. Two widely used simulation tools in this field are <strong style="font-size: 12.8px;">SLiM</strong><span style="font-size: 12.8px; font-weight: normal;"> and </span><strong style="font-size: 12.8px;">msprime</strong><span style="font-size: 12.8px; font-weight: normal;">. While both serve different purposes, they can be used together with the </span><strong style="font-size: 12.8px;">slendr</strong><span style="font-size: 12.8px; font-weight: normal;"> framework to compare simulation outputs effectively.</span></p><h2>Overview of SLiM and msprime</h2><h3>SLiM: Forward Genetic Simulator</h3><p>SLiM is a <strong>free, open-source</strong> tool designed for forward genetic simulations. It allows researchers to model complex evolutionary scenarios, including selection, recombination, and demographic events, making it particularly useful for studying adaptation and selection in populations.</p><p><strong>Key Features of SLiM:</strong></p><ul>
<li>
<p>Simulates population evolution forward in time</p>
</li>
<li>
<p>Supports custom evolutionary models using an embedded scripting language</p>
</li>
<li>
<p>Allows modeling of spatial and ecological dynamics</p>
</li>
<li>
<p>Provides high flexibility and extensibility for user-defined scenarios</p>
</li>
<li>
<p>Available on GitHub as an open-source project</p>
</li>
</ul><h3>msprime: Ancestry and Mutation Simulator</h3><p>msprime is an efficient, <strong>open-source</strong> tool that simulates ancestry and mutations using a coalescent framework. It is known for its high-speed performance and low memory requirements, making it a popular choice for large-scale genomic simulations.</p><p><strong>Key Features of msprime:</strong></p><ul>
<li>
<p>Implements coalescent simulations for ancestry modeling</p>
</li>
<li>
<p>Efficiently simulates large population histories</p>
</li>
<li>
<p>Supports the addition of mutations to genealogies</p>
</li>
<li>
<p>Developed using an open-source community model</p>
</li>
<li>
<p>Often faster and more memory-efficient than alternative simulators</p>
</li>
</ul><h2>Using SLiM and msprime with slendr</h2><p>Both SLiM and msprime can be integrated with <strong>slendr</strong>, a framework that facilitates structured population genetic simulations. This integration allows for seamless comparison of simulation outputs.</p><h3>How They Work Together:</h3><ul>
<li>
<p>SLiM and msprime simulations can be analyzed within slendr.</p>
</li>
<li>
<p>The <strong>ts_read()</strong> function in slendr enables loading and comparing tree sequence outputs from both simulators.</p>
</li>
<li>
<p>This integration allows researchers to validate simulation results and gain deeper insights into evolutionary processes.</p>
</li>
</ul><h2>Performance Considerations</h2><p>While SLiM offers powerful forward simulations with extensive customization, msprime is often preferred for its <strong>speed and memory efficiency</strong> when simulating ancestry and mutations. The choice between the two depends on the research goals:</p><ul>
<li>
<p><strong>For detailed evolutionary modeling with selection and recombination:</strong> Use SLiM.</p>
</li>
<li>
<p><strong>For large-scale coalescent simulations with mutations:</strong> Use msprime.</p>
</li>
<li>
<p><strong>For comparing different simulation models and their outputs:</strong> Use slendr to integrate SLiM and msprime results.</p>
</li>
</ul><h2>Conclusion</h2><p>SLiM and msprime are valuable tools for genome simulation, each serving distinct but complementary purposes in population genetics research. By leveraging the strengths of both simulators with slendr, researchers can conduct robust and efficient evolutionary simulations, enhancing our understanding of genetic diversity and adaptation.</p><p>For more information, check out the official GitHub repositories for <strong>SLiM</strong> and <strong>msprime</strong>, and explore the <strong>slendr</strong> framework for streamlined simulation workflow</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</guid>
	<pubDate>Tue, 18 Aug 2026 04:38:23 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45240/pg2-making-pangenome-graphs-easier-to-understand</link>
	<title><![CDATA[PG2: Making Pangenome Graphs Easier to Understand]]></title>
	<description><![CDATA[<p>Genomics is moving beyond the traditional approach of studying DNA using a single reference genome. Today, researchers are increasingly using pangenomes, which represent genetic information from multiple genomes and capture a much broader range of genetic diversity.</p><p>However, pangenome graphs can be highly complex, making them difficult to visualize and interpret. A recent study published in BMC Bioinformatics introduces PG2 (PanGenoGrapher), an open-source, web-based tool designed to address this challenge.&nbsp;The source code and user guide are openly available on GitHub at https://github.com/iVis-at-Bilkent/pangenographer. A publicly accessible sample deployment is hosted at http://pg2.cs.bilkent.edu.tr. In addition, a demonstration video illustrating the primary use cases of PG2 is available at https://www.youtube.com/watch?v=yCd7-aGY6CQ.</p><p>PG2 combines advanced graph-layout algorithms with an interactive visualization platform. It allows researchers to explore genomic paths, identify variations, and examine relationships between different parts of a pangenome graph more easily.</p><p>This is important because visualization can play a major role in bioinformatics. When complex genomic information is presented clearly, researchers can more easily identify patterns, understand genetic variation, and generate new biological insights.</p><p>The development of PG2 represents a step toward making pangenome analysis more accessible and intuitive. As genomic datasets continue to grow and graph-based representations become more common, tools like PG2 can help researchers navigate this increasing complexity.</p><p>Ultimately, PG2 demonstrates how combining genomics, graph algorithms, and interactive visualization can make sophisticated biological data easier to understand and analyze.</p><p>Reference: Solun, G. K., Dogrusoz, U., Bing&ouml;l, Z., &amp; Alkan, C. (2026). PG2: algorithms and a web-based tool for effective layout and visual analysis of pangenome graphs. BMC Bioinformatics. DOI: 10.1186/s12859-026-06555-4.</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45289/the-atlas-of-nine-billion-possibilities</guid>
	<pubDate>Wed, 09 Sep 2026 02:07:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45289/the-atlas-of-nine-billion-possibilities</link>
	<title><![CDATA[The Atlas of Nine Billion Possibilities]]></title>
	<description><![CDATA[<p>Imagine a book that holds all the instructions for building a human, made up of billions of letters. What if you changed just one letter? Maybe nothing would happen. Or that tiny change could affect how a gene works, quietly shaping a cell&rsquo;s biology or even helping cause disease.</p><p>Scientists face a big challenge with the human genome. They can read its letters, but understanding their roles is much harder. Only about 2 percent of the genome codes for proteins. The rest acts like a huge control panel, deciding when and where genes turn on. With about 9 billion possible single-letter changes, testing them all in a lab just isn&rsquo;t possible.</p><p>So, Google DeepMind asked a new question: what if we could predict what those changes might do?</p><p>This question led to the AlphaGenome Atlas (https://deepmind.google.com/science/alphagenome/atlas?), a detailed map of nearly every possible single-letter change in the human genome. Instead of checking each change one by one, researchers can use the Atlas to spot the ones most likely to matter. The AlphaGenome Variant Impact (AVI) score works like a trail marker, pointing scientists toward the changes worth a closer look.</p><p>This is where the Atlas gets especially useful. Much of the genome lies outside the protein-coding regions, where DNA acts as a switch or controller for genes. AlphaGenome lets researchers explore these areas and see how small changes could affect gene activity.</p><p>An atlas isn't the destination; it's a guide.</p><p>The AlphaGenome Atlas doesn&rsquo;t replace experiments or solve every mystery. Instead, it helps scientists decide where to begin. From billions of possibilities, it turns the vast genetic landscape into something researchers can start to explore.</p><p>There are nine billion possibilities, a vast map, and maybe among them therWith nine billion possibilities and a huge map to explore, there may be clues hidden here to some of medicine&rsquo;s toughest mysteries.</p><p>More at&nbsp;https://storage.googleapis.com/deepmind-media/DeepMind.com/Blog/alphagenome-atlas-a-predictive-map-of-every-possible-dna-letter-change-in-the-human-genome/alphagenome-atlas.pdf</p>]]></description>
	<dc:creator>Jitendra Narayan</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</guid>
	<pubDate>Mon, 05 Oct 2026 12:14:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45358/the-variant-everyone-ignored</link>
	<title><![CDATA[The Variant Everyone Ignored]]></title>
	<description><![CDATA[<p>Consider a scenario in which a patient's genome has been sequenced. Among billions of DNA bases, a structural alteration may explain the patient's disease. Multiple advanced algorithms analyze the data, yet only one detects the variant, while the others do not. In standard bioinformatics workflows, such a solitary result is often regarded as unreliable and subsequently discarded. Although the solution exists within the data, prevailing computational protocols may overlook it.</p><p>A recent study published in Genome Biology (https://link.springer.com/article/10.1186/s13059-026-04280-y) addressed this challenge by introducing dicast (https://github.com/burgshrimps/dicast), a machine-learning approach for detecting structural variants in short-read sequencing data. Structural variants, such as large deletions, insertions, duplications, and inversions, can have significant biological and clinical implications, yet they are challenging to identify with short-read technologies. Because different detection methods frequently yield divergent results, researchers commonly employ consensus calling, considering a variant valid only if multiple tools detect it. While this approach reduces false positives, it relies on the potentially flawed assumption that the majority is always correct.</p><p>The researchers explored the impact of evaluating the supporting evidence for each variant, rather than simply tallying the number of algorithms that identified it. To establish a ground truth, they analyzed nine genomes using multiple sequencing technologies and 15 detection methods, initially identifying approximately 35 million potential variants. Through extensive filtering, evidence integration, and manual review of over 11,500 variants, they developed a robust benchmark comprising more than 236,000 structural variants. The findings underscored the complexity of the problem: short-read methods detected fewer than half of deletions and less than 10 percent of insertions, with performance declining markedly in repetitive genomic regions. In contrast, long-read technologies demonstrated superior detection capabilities. However, replacing the substantial volume of existing short-read data in clinical and research settings is not immediately feasible. Consequently, the researchers questioned whether short-read data might harbor more information than conventional analytical pipelines currently extract.</p><p>This line of inquiry led to the development of dicast. Rather than merely confirming agreement among multiple tools, dicast identifies patterns in sequencing data, including split and clipped reads, discordant read pairs, alignment characteristics, and the surrounding genomic context. An XGBoost machine-learning model evaluates which combinations of these signals are indicative of genuine structural variants. Thus, the approach shifts from tallying algorithmic consensus to interpreting the underlying evidence.</p><p>The researchers subsequently conducted a targeted evaluation by examining structural variants detected by only a single short-read tool, which are typically missed by consensus-based approaches. dicast successfully recovered approximately 81% of these single-caller deletions, insertions, and duplications. The signals for these variants were present in the data, but conventional filtering methods failed to integrate them effectively.</p><p>The utility of dicast was further demonstrated in cohorts with rare diseases, including congenital limb malformations, atrial fibrillation, and neuromuscular disorders. In one instance, dicast achieved a deletion recall rate of approximately 0.96, compared to 0.74 using consensus calling. The median number of variants requiring manual review was 29 per sample. Among 31 experimentally validated variants that standard filters would have missed, dicast identified 12, whereas consensus calling detected only one.</p><p>Overall, dicast identified approximately 20 percent more potential disease-causing deletions than consensus-based methods. While a 20 percent increase may appear modest, in clinical genomics such improvements can have significant practical implications. Missing a deletion may leave a case unresolved, whereas detecting a structural variant can provide critical diagnostic insights.</p><p>The study does not claim that machine learning has rendered short-read sequencing superior to long-read approaches. Instead, the results underscore the effectiveness of long-read sequencing for structural variant detection. However, dicast highlights a more nuanced perspective: substantial biological information may still be recoverable from the extensive short-read datasets already available.</p><p>The principal lesson extends beyond the detection of structural variants. For many years, bioinformatics pipelines have relied on threshold-based criteria, such as minimum coverage, quality scores, or support from multiple tools. While these rules are useful, biological phenomena do not always conform to rigid checklists; multiple weak signals, when considered collectively, can provide compelling evidence.</p><p>This perspective prompts consideration of the solitary variant: one algorithm identifies it, while several others do not. Traditional consensus techniques might have dismissed it, yet machine learning approaches evaluate the available evidence to determine whether the variant is plausible.</p><p>Occasionally, the most significant variant within a genome is the one that is almost universally overlooked.</p><p>Read more at&nbsp;https://link.springer.com/article/10.1186/s13059-026-04280-y</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/861/fiona-brinkman-laboratory</guid>
  <pubDate>Sun, 14 Jul 2013 12:46:31 -0500</pubDate>
  <link></link>
  <title><![CDATA[Fiona Brinkman Laboratory]]></title>
  <description><![CDATA[
<p>Infectious disease control needs to be made more “sustainable”. We need to reduce selective pressure on pathogens to evolve antibiotic resistance. We need to control infectious disease outbreaks and associated immune disorders with a better understanding of the genetic,  environmental and social factors that impact disease spread and severity.</p>

<p>Research Area</p>

<p>Investigating the role in disease of both the microbe and its host (i.e immune system failure), using genomics and systems biology-based approaches<br />Using genomics and network analysis to characterize disease outbreaks and their environmental/social/genetic causes, and<br />Identifying new anti-infective and immune modulating therapies/biomarkers.</p>

<p>Link @ http://www.brinkman.mbb.sfu.ca/</p>
]]></description>
</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>

</channel>
</rss>