<?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/42038?offset=120</link>
	<atom:link href="https://bioinformaticsonline.com/related/42038?offset=120" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</guid>
	<pubDate>Tue, 30 May 2017 04:20:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/33306/ancestral-sequence-reconstruction-asr-or-ancestral-genesequence-reconstructionresurrection-tools-to-study-molecular-evolution</link>
	<title><![CDATA[Ancestral sequence reconstruction (ASR) or ancestral gene/sequence reconstruction/resurrection tools to study molecular evolution]]></title>
	<description><![CDATA[<p><span><strong>Ancestral sequence reconstruction</strong><span>&nbsp;(</span><strong>ASR</strong><span>) &ndash; also known as&nbsp;</span><strong>ancestral gene</strong><span>/</span><strong>sequence reconstruction</strong><span>/</span><strong>resurrection</strong><span>&nbsp;&ndash; is a technique used in the study of&nbsp;</span>molecular evolution<span>. The method consists of the synthesis of an ancestral&nbsp;</span>gene<span>&nbsp;and expression of the corresponding ancestral&nbsp;</span>protein<span>.&nbsp;</span><sup id="cite_ref-thornton_1-0"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a></sup><span>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.</span><sup id="cite_ref-2"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a></sup><span>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;</span>Steven A. Benner<span>, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.</span><sup id="cite_ref-3"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a></sup><span>&nbsp;Thanks to the improvement of algorithms and of better sequencing and synthesis techniques, the method was developed further in the early 2000s to allow the resurrection of a greater variety of and much more ancient genes.</span><sup id="cite_ref-4"><a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a></sup><span>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</span></span></p><p><img src="https://upload.wikimedia.org/wikipedia/commons/thumb/e/e4/ASR_phylogeny.png/510px-ASR_phylogeny.png" alt="image" width="610" height="435" style="border: 0px; border: 0px;"></p><p><span>Following are the list of&nbsp;</span><strong style="font-size: 12.8px;">Ancestral /sequence/ reconstruction</strong><span>&nbsp;(</span><strong style="font-size: 12.8px;">ASR</strong><span>) tools:&nbsp;</span></p><p><a href="http://www.bx.psu.edu/miller_lab/car/" target="_blank" title="To inferCars official website"><span>inferCars</span></a></p><p><span><span><span><span><span>Reconstructs contiguous regions of an ancestral genome. Given information about adjacencies between conserved segments in each modern species, our goal is to infer segment order in the ancestral genome. To get a clean and precise statement of the problem, we formalize it using graph theory. We develop an algorithm that identifies a most parsimonious scenario for the history of each individual adjacency, although the whole-genome prediction is not guaranteed to optimize traditional measures like the number of breakpoints. We introduce weights to the graph edges to model the reliability of each adjacency.</span></span></span></span></span></p><p><span><span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">ANGES</a>:</span><a href="http://paleogenomics.irmacs.sfu.ca/ANGES/" target="_blank" title="To ANGES official website">reconstructing ANcestral GEnomeS maps</a></span></p><p><span><span><span><span><span><span>A suite of Python programs that allows reconstructing ancestral genome maps from the comparison of the organization of extant-related genomes. ANGES can reconstruct ancestral genome maps for multichromosomal linear genomes and unichromosomal circular genomes. It implements methods inspired from techniques developed to compute physical maps of extant genomes.</span></span></span></span></span></span></p><p><a href="http://virulence.molgen.mpg.de/cocos/" target="_blank" title="To Cocos official website"><span>Cocos</span></a></p><p><span><span><span><span><span><span><span>Constructs phylogenies of multi-domain proteins. With a given species tree and domain phylogenies, the procedure infers the composition of ancestral multi-domain proteins. Cocos implements and extend a suggested algorithmic approach by Behzadi and Vingron in an easy-to-use program. Such method could be applied to reconstruction of partial homologous units such as bacterial operons or protein complexes.</span></span></span></span></span></span></span></p><p><a href="https://github.com/msrosenberg/MySSP" target="_blank" title="To MySSP official website"><span>MySSP</span></a></p><p><span><span><span><span><span><span><span><span>Constructs an initial DNA sequence at the root of the tree and simulates evolution across the tree using a variety of common models of DNA evolution. MySSP is a program for the simulation of DNA sequence evolution across a phylogenetic tree. It is designed for large-scale studies, including simulation of multiple replicates and outputs sequences into NEXUS, MEGA, or FASTA formats. MySSP has a fairly simple graphical user interface (GUI) for basic use, but also has a specialized batch script interpreter to allow for more complicated or large-scale simulations.</span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">PARANA</a>:&nbsp;</span><a href="http://www.cs.cmu.edu/~ckingsf/software/parana/" target="_blank" title="To PARANA official website">Parsimonious Ancestral Reconstruction And Network Analysis</a></span></p><p><span><span><span><span><span><span><span><span><span>Performs parsimony based inference of ancestral biological networks. Given multiple extant networks and phylogenetic information relating extant nodes, PARANA finds a parsimonious set of ancestral interaction events (edge gains and losses) which explain the extant networks. The framework adopted by PARANA is able to represent network evolution under models that support gene duplication and loss and independent interaction gain and loss. The method works on both directed and undirected networks and can incorporate asymmetric interaction gain and loss costs. In contrast to previous approaches, PARANA does not require knowing the relative ordering of unrelated duplication events and thus, works on phylogenetic trees even where branch lengths are not provided.</span></span></span></span></span></span></span></span></span></p><p><span><span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">GapAdj</a>:&nbsp;</span><a href="http://www-labs.iro.umontreal.ca/~mabrouk/" target="_blank" title="To GapAdj official website">Gapped Adjacencies</a></span></p><p><span><span><span><span><span><span><span><span><span><span>A synteny-based method that is flexible enough to handle a model of evolution involving whole genome duplication events, in addition to rearrangements, gene insertions, and losses. Ancestral relationships between markers are defined in term of Gapped Adjacencies, i.e. pairs of markers separated by up to a given number of markers. It improves on a previous restricted to direct adjacencies, which revealed a high accuracy for adjacency prediction, but with the drawback of being overly conservative, i.e. of generating a large number of contiguous ancestral regions (CARs).</span></span></span></span></span></span></span></span></span></span></p><p><a href="http://ancestors.bioinfo.uqam.ca/"><span><span><span><span><span><span><span><span><span><span>ANCESTOR</span></span></span></span></span></span></span></span></span></span></a></p><p><span><span><span><span><span><span><span><span><span><span><span>A web server allowing one to easily and quickly perform the last three steps of the ancestral genome reconstruction procedure. Ancestors implements several alignment algorithms, an indel maximum likelihood solver and a context-dependent maximum likelihood substitution inference algorithm. The results presented by the server include the posterior probabilities for the last two steps of the ancestral genome reconstruction and the expected error rate of each ancestral base prediction.</span></span></span></span></span></span></span></span></span></span></span></p><p><a href="http://bioinfo.lifl.fr/procars/" target="_blank" title="To ProCARs official website"><span>ProCARs</span></a></p><p>Reconstructs ancestral gene orders as contiguous ancestral regions (CARs) with a progressive homology-based method. ProCARs runs from a phylogeny tree (without branch lengths needed) with a marked ancestor and a block file. This homology-based method is based on iteratively detecting and assembling ancestral adjacencies, while allowing some micro-rearrangements of synteny blocks at the extremities of the progressively assembled CARs. The method starts with a set of blocks as the initial set of CARs, and detects iteratively the potential ancestral adjacencies between extremities of CARs, while building up the CARs progressively by adding, at each step, new non-conflicting adjacencies that induce the less homoplasy phenomenon. The species tree is used, in some additional internal steps, to compute a score for the remaining conflicting adjacencies, and to detect other reliable adjacencies, in order to reach completely assembled ancestral genomes.</p><p><a href="http://fastml.tau.ac.il/" target="_blank" title="To FastML official website"><span>FastML</span></a></p><p>A user-friendly tool for the reconstruction of ancestral sequences. FastML implements various novel features that differentiate it from existing tools: (i) FastML uses an indel-coding method, in which each gap, possibly spanning multiples sites, is coded as binary data. FastML then reconstructs ancestral indel states assuming a continuous time Markov process. FastML provides the most likely ancestral sequences, integrating both indels and characters; (ii) FastML accounts for uncertainty in ancestral states: it provides not only the posterior probabilities for each character and indel at each sequence position, but also a sample of ancestral sequences from this posterior distribution, and a list of the k-most likely ancestral sequences; (iii) FastML implements a large array of evolutionary models, which makes it generic and applicable for nucleotide, protein and codon sequences; and (iv) a graphical representation of the results is provided, including, for example, a graphical logo of the inferred ancestral sequences.</p><p><a href="http://rth.dk/resources/maxAlike/" target="_blank" title="To maxAlike official website"><span>maxAlike</span></a></p><p>Reconstructs a genomic sequence for a specific taxon based on sequence homologs in other species. The input is a multiple sequence alignment and a phylogenetic tree that also contains the target species. For this target species, the algorithm computes nucleotide probabilities at each sequence position. Consensus sequences are then reconstructed based on a certain confidence level.</p><p><span><span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">MLGO</a>:&nbsp;</span><a href="http://www.geneorder.org/server.php" target="_blank" title="To MLGO official website">Maximum Likelihood for Gene Order Analysis</a></span></p><p>A web tool for the reconstruction of phylogeny and/or ancestral genomes from gene-order data. MLGO was designed for analysis of large-scale genomic changes including not only rearrangements but also gene insertions, deletions and duplications. MLGO can be used to infer a phylogeny from genome rearrangement and gene order data, and can also obtain an estimation of ancestral genomes, given an input tree. MLGO takes the advantage of binary encoding on gene-order data, supports a fairly general model of genomic evolution (rearrangements plus duplications, insertions, and losses of genomic regions), and successfully accommodates itself into the framework of maximized likelihood.</p><p>Image Reference : Wiki</p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</guid>
	<pubDate>Sat, 02 Jun 2018 07:38:33 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36849/glean-an-unsupervised-learning-system-to-integrate-disparate-sources-of-gene-structure-evidence</link>
	<title><![CDATA[GLEAN: an unsupervised learning system to integrate disparate sources of gene structure evidence]]></title>
	<description><![CDATA[<p><span>GLEAN is an unsupervised learning system to integrate disparate sources of gene structure evidence (gene model predictions, EST/protein genomic sequence alignments, SAGE/peptide tags, etc) to produce a consensus gene prediction, without prior training.</span></p><p>Address of the bookmark: <a href="https://sourceforge.net/projects/glean-gene/" rel="nofollow">https://sourceforge.net/projects/glean-gene/</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38541/geneoverlap-an-r-package-to-test-and-visualize-gene-overlaps</guid>
	<pubDate>Thu, 27 Dec 2018 19:45:52 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38541/geneoverlap-an-r-package-to-test-and-visualize-gene-overlaps</link>
	<title><![CDATA[GeneOverlap: An R package to test and visualize gene overlaps]]></title>
	<description><![CDATA[<p>Overlapping gene lists can reveal biological meanings and may lead to novel hypotheses. For example, histone modification is an important cellular mechanism that can pack and re-pack chromatin. By making the chromatin structure more dense or loose, the gene expression can be turned on or off. Tri-methylation on lysine 4 of histone H3 (H3K4me3) is associated with gene activation and its genome-wide enrichment can be mapped by using ChIP-seq experiments. Because of its activating role, if we overlap the genes that are bound by H3K4me3 with the genes that are highly expressed, we should expect a positive association. Similary, we can perform such kind of overlapping between the gene lists of different histone modifications with that of various expression groups and establish each histone modification&rsquo;s role in gene regulation.</p><p>Address of the bookmark: <a href="https://bioconductor.org/packages/release/bioc/vignettes/GeneOverlap/inst/doc/GeneOverlap.pdf" rel="nofollow">https://bioconductor.org/packages/release/bioc/vignettes/GeneOverlap/inst/doc/GeneOverlap.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</guid>
	<pubDate>Tue, 14 Jul 2020 06:42:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41969/shadowcaster-a-hybrid-approach-for-the-detection-of-horizontal-gene-transfer-events-in-prokaryotes</link>
	<title><![CDATA[ShadowCaster: a hybrid approach for the detection of horizontal gene transfer events in prokaryotes]]></title>
	<description><![CDATA[<p><span>ShadowCaster implements an evolutionary model to calculate Bayesian likelihoods for each &lsquo;alien genes&rsquo; with an unusual sequence composition according to the host genome background to detect HGT events in prokaryotes.</span></p>
<p><a href="https://www.mdpi.com/2073-4425/11/7/756/htm">https://www.mdpi.com/2073-4425/11/7/756/htm</a></p>
<p><a href="https://shadowcaster.readthedocs.io/en/latest/">https://shadowcaster.readthedocs.io/en/latest/</a></p>
<p><a href="https://github.com/dani2s/ShadowCaster_testData">https://github.com/dani2s/ShadowCaster_testData</a></p><p>Address of the bookmark: <a href="https://github.com/dani2s/ShadowCaster" rel="nofollow">https://github.com/dani2s/ShadowCaster</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</guid>
	<pubDate>Sat, 03 Jun 2023 19:19:10 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44327/homologizer-phylogenetic-phasing-of-gene-copies-into-polyploid-subgenomes</link>
	<title><![CDATA[homologizer: Phylogenetic phasing of gene copies into polyploid subgenomes]]></title>
	<description><![CDATA[<p dir="auto">This tutorial describes the usage of&nbsp;<code>homologizer</code>&nbsp;to phase gene copies into polyploid subgenomes. The tutorial is an abbreviated version of a soon-to-be published paper in Methods in Molecular Biology. Please see that paper for many more details and practical considerations for running&nbsp;<code>homologizer</code>&nbsp;analyses. If you use&nbsp;<code>homologizer</code>, please cite the paper in which we first describe the method:</p>
<ul dir="auto">
<li>Freyman, W.A., Johnson, M.G., and C.J. Rothfels. 2022. Homologizer: phylogenetic phasing of gene copies into polyploid subgenomes.&nbsp;<em>bioRxiv</em>&nbsp;<a href="https://www.biorxiv.org/content/10.1101/2020.10.22.351486v4">2020.10.22.351486v4</a></li>
</ul>
<p dir="auto"><code>homologizer</code>&nbsp;is implemented in&nbsp;<code>RevBayes</code>. Please see&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>&nbsp;to download and install&nbsp;<code>RevBayes</code>. For users without previous&nbsp;<code>RevBayes</code>&nbsp;experience, we recommend the tutorials at&nbsp;<a href="http://revbayes.com/">http://revbayes.com</a>.</p><p>Address of the bookmark: <a href="https://github.com/wf8/homologizer" rel="nofollow">https://github.com/wf8/homologizer</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/13522/yannick-wurm-lab</guid>
  <pubDate>Thu, 07 Aug 2014 18:02:37 -0500</pubDate>
  <link></link>
  <title><![CDATA[Yannick Wurm Lab]]></title>
  <description><![CDATA[
<p>Evolutionary genomics of social insects. Extensive theoretical work has explained how and why complex societies evolve. However, only little is known about the genes and molecular mechanisms responsible for social phenotypes. We have been identifying genes and mechanisms involved in the evolution of insect societies using modern genomics tools (Illumina, RNAseq, RADseq...). For example we recently:</p>

<p>1. sequenced and analyzed the genome of the invasive red fire ant Solenopsis invicta (PNAS 2011)</p>

<p>2. discovered that a fundamental social trait in this species (how many queens are accepted in the colony) is determined by variants of a social chromosome (Nature 2013).</p>

<p>3. described the gene expression changes that occur in a virgin queen when she is given the opportunity of replacing her mother (Mol Ecol 2010).</p>

<p>Homepage: http://yannick.poulet.org/</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</guid>
	<pubDate>Mon, 22 May 2017 05:43:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/32905/bigmac-breaking-inaccurate-genomes-and-merging-assembled-contigs-for-long-read-metagenomic-assembly</link>
	<title><![CDATA[BIGMAC : breaking inaccurate genomes and merging assembled contigs for long read metagenomic assembly]]></title>
	<description><![CDATA[<p>This tool is for users to upgrade their metagenomics assemblies using long reads. This includes fixing mis-assemblies and scaffolding/gap-filling. If you encounter any issues, please contact me at&nbsp;<a href="mailto:kklam@eecs.berkeley.edu">kklam@eecs.berkeley.edu</a>. My name is Ka-Kit Lam.</p>
<p>https://github.com/kakitone/MetaFinisherSC</p>
<p>https://github.com/kakitone/BIGMAC</p><p>Address of the bookmark: <a href="https://github.com/kakitone/BIGMAC" rel="nofollow">https://github.com/kakitone/BIGMAC</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36723/hapsembler-an-assembler-for-highly-polymorphic-genomes</guid>
	<pubDate>Tue, 22 May 2018 04:09:53 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36723/hapsembler-an-assembler-for-highly-polymorphic-genomes</link>
	<title><![CDATA[Hapsembler: An Assembler for Highly Polymorphic Genomes]]></title>
	<description><![CDATA[Hapsembler is a haplotype-specific genome assembly toolkit that is designed for genomes that are rich in SNPs and other types of polymorphism. Hapsembler can be used to assemble reads from a variety of platforms including Illumina and Roche/454. 

http://compbio.cs.toronto.edu/hapsembler/<p>Address of the bookmark: <a href="http://compbio.cs.toronto.edu/hapsembler/" rel="nofollow">http://compbio.cs.toronto.edu/hapsembler/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/news/view/40385/598-indian-genomes-from-55-ethnic-groups-sequenced</guid>
	<pubDate>Fri, 13 Dec 2019 20:31:42 -0600</pubDate>
	<link>https://bioinformaticsonline.com/news/view/40385/598-indian-genomes-from-55-ethnic-groups-sequenced</link>
	<title><![CDATA[598 Indian Genomes from 55 ethnic groups Sequenced]]></title>
	<description><![CDATA[<ul>
<li><strong>This study reports sequence from 1,267 individuals that includes 598 individuals representing 55 ethnic groups that span the major language groups across India.</strong></li>
</ul><ul>
<li><strong>Importantly, this study found many large population groups from India in which individuals were more related to each other by descent. These groups are similar to the Finnish population group where many disease gene discoveries were made. The Finnish-equivalent Indian groups are going to be a great resource for disease gene discovery and they will aid in target identification, drug development and disease management.</strong><strong style="font-size: 12.8px;">&nbsp;</strong></li>
</ul><ul>
<li><strong>This study has identified many genetic variants that are specific to Indian population groups that were previously not known. Some of these are common variants in the Indian groups, but when first identified by previous studies from India involving smaller sample size, they were thought to be disease causing (for example in diabetes) as they were not represented in the Eurocentric variant database.&nbsp;</strong></li>
</ul><p><strong><img src="https://media.springernature.com/full/springer-static/image/art%3A10.1038%2Fs41586-019-1793-z/MediaObjects/41586_2019_1793_Fig1_HTML.png" alt="image" style="border: 0px;"></strong></p><ul>
<li><strong>Several variants that pre-dispose individuals to higher cancer risk were identified in this study. Once this part of the work is expanded, the data from this can be used to screen individuals to understand the disease risk and provide appropriate monitoring and proactive treatment. Similarly, variants linked to increase in adverse effect in individuals for certain drugs were found. Understanding this will allow doctors to provide alternate safer drugs to such patients.</strong></li>
</ul><p><strong>More at&nbsp;<a href="https://www.nature.com/articles/s41586-019-1793-z">https://www.nature.com/articles/s41586-019-1793-z</a></strong></p><p><strong><a href="https://www.nature.com/nature/volumes/576/issues/7785">https://www.nature.com/nature/volumes/576/issues/7785</a></strong></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44635/1000-genomes-chile-project</guid>
	<pubDate>Thu, 08 Aug 2024 01:24:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44635/1000-genomes-chile-project</link>
	<title><![CDATA[1000 Genomes Chile Project]]></title>
	<description><![CDATA[<p>Welcome to Chile Sequence to Chile: A Genomic Exploration Project for the Future Genomics, the science that deciphers the complexity of DNA, immerses us in the world of life at its most basic level. On this journey into the depths of genetic information, we find the 1000 Genomes Chile Project, an initiative that seeks to explore and understand the genetic wealth of our country.</p>
<p>Deciphering Life at the Molecular Level DNA sequencing is the key that opens the door to invaluable knowledge. By understanding the genes that make up Chilean species, we unravel the secrets of their evolution, their resistance and their adaptation to the environment. In a world where biodiversity faces constant threats, sequencing becomes crucial for the conservation and understanding of our natural heritage.</p>
<p>Involving Everyone: A Nationwide Effort The 1000 Genomes Chile Project is not just a task for scientists. It is a country-wide effort that seeks the participation of everyone: from citizens to the government to the private sector. We believe in the importance of sharing knowledge, involving society in the selection of species to sequence, in monitoring progress and in applying the results to preserve our environment.</p><p>Address of the bookmark: <a href="https://1000genomas.cl/" rel="nofollow">https://1000genomas.cl/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>