<?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/32633?offset=1310</link>
	<atom:link href="https://bioinformaticsonline.com/related/32633?offset=1310" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44549/quartet-a-telomere-to-telomere-toolkit-for-gap-free-genome-assembly-and-centromeric-repeat-identification</guid>
	<pubDate>Sat, 08 Jun 2024 15:54:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44549/quartet-a-telomere-to-telomere-toolkit-for-gap-free-genome-assembly-and-centromeric-repeat-identification</link>
	<title><![CDATA[quarTeT: a telomere-to-telomere toolkit for gap-free genome assembly and centromeric repeat identification.]]></title>
	<description><![CDATA[<p><span>quarTeT is a collection of tools for T2T genome assembly and basic analysis in automatic workflow.</span><br><br><span>Task include:</span></p>
<ul>
<li><a href="http://www.atcgn.com:8080/quarTeT/docuWeb.html#AssemblyMapper">AssemblyMapper</a>&nbsp;: reference-guided genome assembly</li>
<li><a href="http://www.atcgn.com:8080/quarTeT/docuWeb.html#GapFiller">GapFiller</a>&nbsp;: long-reads based gap filling</li>
<li><a href="http://www.atcgn.com:8080/quarTeT/docuWeb.html#TeloExplorer">TeloExplorer</a>&nbsp;: telomere identification</li>
<li><a href="http://www.atcgn.com:8080/quarTeT/docuWeb.html#CentroMiner">CentroMiner</a>&nbsp;: centromere candidate prediction</li>
</ul>
<p>https://academic.oup.com/hr/article/10/8/uhad127/7197191?login=false&nbsp;</p><p>Address of the bookmark: <a href="http://www.atcgn.com:8080/quarTeT/home.html" rel="nofollow">http://www.atcgn.com:8080/quarTeT/home.html</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/researchlabs/view/30245/venkatesh-lab</guid>
  <pubDate>Tue, 20 Dec 2016 04:38:01 -0600</pubDate>
  <link></link>
  <title><![CDATA[Venkatesh Lab]]></title>
  <description><![CDATA[
<p>We are using a comparative genomics approach to better understand the structure, function and evolution of the human genome. Our group is one of the pioneers in the field of comparative genomics. We proposed the compact genome of the fugu (Takifugu rubripes) as a model vertebrate genome in 1993 (Nature 366: 265-268, 1993) and determined its whole genome sequence in 2002 (Science 297: 1301-1310, 2002).</p>

<p>More at <br />https://zfin.org/ZDB-LAB-110408-1<br />http://www.imcb.a-star.edu.sg/php/venkatesh.php</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</guid>
	<pubDate>Thu, 22 Dec 2016 10:30:49 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30336/finding-patterns-in-biological-sequences</link>
	<title><![CDATA[Finding Patterns in Biological Sequences]]></title>
	<description><![CDATA[<p>In this report we provide an overview of known techniques for discovery of patterns of biological sequences (DNA and proteins). We also provide biological motivation, and methods of biological verification of such patterns. Finally we list publicly available tools and databases for pattern discovery. On-line supplement is available through http://genetics.uwaterloo.ca/&sim;tvinar/cs798g/motif.</p><p>Address of the bookmark: <a href="http://engr.case.edu/li_jing/papers/00798gpattern.pdf" rel="nofollow">http://engr.case.edu/li_jing/papers/00798gpattern.pdf</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30538/gkno</guid>
	<pubDate>Tue, 17 Jan 2017 03:35:34 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30538/gkno</link>
	<title><![CDATA[GKNO]]></title>
	<description><![CDATA[<p><span>gkno opens the world of complex bioinformatic analysis to people of all level of computational expertise. This site contains documentation, tutorials and information on all the tools that comprise gkno.</span></p>
<p><span>More at&nbsp;http://gkno.me/</span></p><p>Address of the bookmark: <a href="http://gkno.me/" rel="nofollow">http://gkno.me/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/30657/studentship</guid>
  <pubDate>Tue, 24 Jan 2017 04:26:14 -0600</pubDate>
  <link></link>
  <title><![CDATA[Studentship]]></title>
  <description><![CDATA[
<p>Advt. No. ACBR/BTBI/BIF/Manpower/ADV/16-17<br />Research Associate/ Studentship/ Traineeship Jobs opportunity in  University of Delhi - Dr. B.R. Ambedkar Center for Biomedical Research (ACBR) on temporary basis<br />Studentship<br />No. of Post : 01<br />Qualifications : Applicants who are pursuing Post Graduate Degree course/ Diploma in Bioinformatics/ Biomedical Sciences/ Biotechnology/Life Sciences/Chemistry/ Biochemistry with a programme in Bioinformatics to carry out the project.<br />Remuneration : Rs. 8,000/-<br />Traineeship<br />No. of Post : 01<br />Qualifications : Applicants who have completed their Post Graduate degree in Bioinformatics /Biomedical Sciences/Biotechnology/Life Sciences/Chemistry/Biochemistry or any other branch of Life Sciences with knowledge in Bioinformatics<br />Remuneration : Rs. 8,000/-<br />Research Associate<br />No. of Post : 01<br />Qualifications : Ph.D. in Bio-Medical Sciences/Bioinformatics/ Biotechnology/Life Sciences/ Chemistry/ Bio-Chemistry and related areas<br />Remuneration : Rs. 36,000/-</p>

<p>Applicant are required to bring applications on plain paper, stating the name, address, date of birth. educational qualifications and experiences and Institute, along with attested photocopies of mark sheets and certificates etc. at the time of Interview. Applications should also be sent by Entail to Dr. Madhu Chopra, Coordinator, BIF Facility. Email: acbrdu.blisnet@nic.in;  mchopradu@gmail.com.<br />Interview Date : 13.02.2017<br />Time : 10:00 am-12:00 noon<br />Venue : ACBR</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</guid>
	<pubDate>Tue, 31 Jan 2017 05:56:30 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30698/itol-interactive-tree-of-life</link>
	<title><![CDATA[iTOL: interactive Tree Of Life]]></title>
	<description><![CDATA[<p><strong>Interactive Tree Of Life</strong><span>&nbsp;is an online tool for the display and manipulation of phylogenetic trees. It provides most of the features available in other tree viewers, and offers a novel circular tree layout, which makes it easy to visualize mid-sized tree (up to several thousand leaves). Trees can be exported to several graphical formats, both bitmap and vector based.</span></p>
<p><img src="http://itol.embl.de/img/home/ex3.png" alt="image" style="border: 0px;"><br><span>There are several pre-computed trees available for display, including the main Tree Of Life, described in&nbsp;</span><a href="http://www.ncbi.nlm.nih.gov/pubmed/16513982">Ciccarelli, et al., 2006</a><span>. In addition to the precomputed trees, users can upload and display personal trees and data, using the 'Data upload' page or through a personal user account.</span></p><p>Address of the bookmark: <a href="http://itol.embl.de/" rel="nofollow">http://itol.embl.de/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30829/mercator</guid>
	<pubDate>Mon, 06 Feb 2017 04:20:36 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30829/mercator</link>
	<title><![CDATA[Mercator]]></title>
	<description><![CDATA[<p><span>Our basic strategy in building homology maps is to use exons that are orthologous in multiple genomes as map "anchors." Given K genomes, the steps in the map construction are as follows:</span></p>
<ul>
<li>For each genome, obtain a set of exon annotations. These annotations can be a combination of both exon predictions (e.g. Genscan) and annotations that have been experimentally verified (e.g. RefSeq). Ideally, we would like to have these annotations be as sensitive as possible. Specificity is not a concern, as incorrect annotations are not likely not have significant alignments with other gene annotations.</li>
<li>Compare all exons against all exons in other genomes and record significant alignments between exons. Currently, we use&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refBLAT">BLAT</a>&nbsp;to do this all-vs-all comparison with alignments being performed in protein space.</li>
<li>Construct a graph with each vertex corresponding to a exon and edges between vertices whose corresponding exons have significant alignments.</li>
<li>Identify cliques in this graph. These cliques are potential anchors to be used in the map.</li>
<li>Starting with the largest cliques (those that have exons in all or most of the genomes), join neighboring (adjacent in genomic coordinates, in each genome) cliques to form&nbsp;runs. Smaller cliques that are inconsistent with runs formed by larger cliques are filtered out. After the smallest cliques have been considered, cliques that are not part of a run are discarded.</li>
<li>The extents of each run in each genome are outputted as orthologous segments. The cliques from each run are used to output the exact genomic coordinates of anchors within each orthologous segment. These anchors can be used by genomic alignment programs (such as&nbsp;<a href="https://www.biostat.wisc.edu/~cdewey/mercator/#refMAVID">MAVID</a>) to do a detailed alignment of each orthologous segment.</li>
</ul>
<p>https://www.biostat.wisc.edu/~cdewey/mercator/</p><p>Address of the bookmark: <a href="https://www.biostat.wisc.edu/~cdewey/mercator/" rel="nofollow">https://www.biostat.wisc.edu/~cdewey/mercator/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</guid>
	<pubDate>Mon, 13 Feb 2017 08:40:23 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30897/finestructure-v2-globetrotter</link>
	<title><![CDATA[fineSTRUCTURE v2 &amp; GLOBETROTTER]]></title>
	<description><![CDATA[<p>Software available at this site</p>
<div>
<ul>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure_info.html">FineSTRUCTURE version 2</a>, a pipeline for running ChromoPainter and FineSTRUCTURE for population inference. A GUI is available for interpretation. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructureR.html">FineSTRUCTURE R scripts</a>, a facility for exploring the results when the GUI is unavailable.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/globetrotter.html">GLOBETROTTER</a>, the admixture dating method based on ChromoPainter. Download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/admixture.html">AdmixturePainting</a>, A set of R tools to inmterpret the results of ADMIXTURE and STRUCTURE-like mixture models.</li>
<li><a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/radpainter.html">RADpainter</a>, finestructure and ChromoPainter for RAD tag data used for non-model organisms.</li>
<li>Scripts to perform many types of conversion. Included in the main software download from the <a href="https://people.maths.bris.ac.uk/%7Emadjl/finestructure/finestructure.html">Downloads</a> page.</li>
</ul>
What this page is This page provides information about and downloads for <strong>methodology for Chromosome Painting</strong>. It is not a facility to analyse your genome. Sorry if you were misled by the punchy name!<br> About Chromosome Painting Painting is an efficient way of identifying important haplotype information from dense genotype data. It describes ancestry in an efficient way suitable for a range of further analyses, including population identification and admixture dating.</div><p>Address of the bookmark: <a href="http://paintmychromosomes.com/" rel="nofollow">http://paintmychromosomes.com/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31123/biodownloader</guid>
	<pubDate>Sat, 25 Feb 2017 17:52:33 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31123/biodownloader</link>
	<title><![CDATA[BioDownloader]]></title>
	<description><![CDATA[<p><strong><em>BioDownloader</em></strong> is a program for downloading and/or updating files from ftp/http servers. The program has unique features that are specifically designed to deal with bioinformatics data files and servers:</p>
<ul>
<li>optimized to work with vast amount of data and very large file sets (~ 10,000 - 100,000).</li>
<li>allows the selective retrieval of only the required files (file masks, ls-lR parsing, recursive search, updates)</li>
<li>has a built-in repository containing the settings for the most common bioinformatics download needs</li>
<li>built-in wizard for batch post-processing of downloaded files (archive extraction, file conversion, etc.)</li>
<li>capable of performing multiple download or update tasks simultaneously</li>
</ul>
<p>BioDownloader has a built-in repository containing the settings for common bioinformatics file-synchronization needs, including the Protein Data Bank (PDB) and National Center for Biotechnology Information (NCBI) databases. It can post-process downloaded files, including archive extraction and file conversions.</p>
<p>http://dunbrack.fccc.edu/BioDownloader/</p><p>Address of the bookmark: <a href="http://dunbrack.fccc.edu/BioDownloader/" rel="nofollow">http://dunbrack.fccc.edu/BioDownloader/</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31205/yasra-reference-based-assembler</guid>
	<pubDate>Wed, 01 Mar 2017 08:32:45 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31205/yasra-reference-based-assembler</link>
	<title><![CDATA[YASRA: Reference based assembler]]></title>
	<description><![CDATA[<p>YASRA (Yet Another Short Read Assembler) performs comparative assembly of short reads using a reference genome, which can differ substantially from the genome being sequenced. Mapping reads to reference genomes makes use of LASTZ (Harris et al), a pairwise sequence aligner compatible with BLASTZ. Special scoring sets were derived to improve the performance, both in runtime and quality for 454 and Illumina sequence reads.</p>
<p>YASRA uses LASTZ (<a href="http://bx.psu.edu/miller_lab">http://bx.psu.edu/miller_lab</a> for released version and <a href="http://www.bx.psu.edu/%7Ersharris/lastz/newer">http://www.bx.psu.edu/~rsharris/lastz/newer</a> for newer version) for aligning the sequences to the reference genome. Please install LASTZ (the newest version on <a href="http://www.bx.psu.edu/%7Ersharris/lastz/newer">http://www.bx.psu.edu/~rsharris/lastz/newer</a>) and add the LASTZ binary in your executable/binary search path before installing YASRA.</p><p>Address of the bookmark: <a href="https://github.com/aakrosh/YASRA" rel="nofollow">https://github.com/aakrosh/YASRA</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>

</channel>
</rss>