<?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/30375?offset=950</link>
	<atom:link href="https://bioinformaticsonline.com/related/30375?offset=950" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</guid>
	<pubDate>Tue, 15 May 2018 02:53:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36607/tarean-a-computational-tool-for-identification-and-characterization-of-satellite-dna-from-unassembled-short-reads</link>
	<title><![CDATA[TAREAN: A computational tool for identification and characterization of satellite DNA from unassembled short reads]]></title>
	<description><![CDATA[<p><strong>TA</strong>ndem&nbsp;<strong>RE</strong>peat&nbsp;<strong>AN</strong>alyzer -TAREAN &ndash; is a computational pipeline for&nbsp;<strong>unsupervised identification of satellite repeats</strong>&nbsp;from unassembled sequence reads. The pipeline uses low-pass whole genome sequence reads and performs their graph-based clustering. Resulting clusters, representing all types of repeats, are then examined for the presence of circular structures and putative satellite repeats are reported.</p>
<p><em><strong>How to use TAREAN</strong></em>:</p>
<ul>
<li>Install a local instance of the pipeline using its source code available from&nbsp;<a href="https://bitbucket.org/petrnovak/repex_tarean" target="_blank" title="TAREAN source code">bitbucket repository</a>.</li>
<li>Use&nbsp; public Galaxy-based server at&nbsp;<a href="https://repeatexplorer-elixir.cerit-sc.cz/" target="_blank">https://repeatexplorer-elixir.cerit-sc.cz/</a>. The server is provided in frame of the&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank">Elixir CZ project</a>&nbsp;and is maintained by&nbsp;<a href="https://www.cesnet.cz/" target="_blank">CESNET</a>&nbsp;and&nbsp;<a href="https://www.cerit-sc.cz/en/index.html" target="_blank">CERIT-SC</a>. Simple registration is required to use this service.</li>
</ul>
<p>Development of TAREAN was supported by&nbsp;<a href="https://www.elixir-czech.cz/" target="_blank" title="ELIXIR-CZ">ELIXIR CZ</a>&nbsp;research infrastructure project (MEYS Grant No: LM2015047).</p>
<p><strong><em>References</em></strong></p>
<p>Novak, P., Avila Robledillo, L., Koblizkova, A., Vrbova, I., Neumann, P., Macas, J. (2017) &ndash;&nbsp;<a href="https://academic.oup.com/nar/article/3574061/" target="_blank">TAREAN: a computational tool for identification and characterization of satellite DNA from unassembled short reads</a>.&nbsp;<em>Nucleic Acids Res.</em>, doi:10.1093/nar/gkx257</p><p>Address of the bookmark: <a href="https://bitbucket.org/petrnovak/repex_tarean" rel="nofollow">https://bitbucket.org/petrnovak/repex_tarean</a></p>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11249/how-to-sequence-the-human-genome-mark-j-kiel</guid>
	<pubDate>Fri, 30 May 2014 13:24:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11249/how-to-sequence-the-human-genome-mark-j-kiel</link>
	<title><![CDATA[How to sequence the human genome - Mark J. Kiel]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/MvuYATh7Y74" frameborder="0" allowfullscreen></iframe>View full lesson: http://ed.ted.com/lessons/how-to-sequence-the-human-genome-mark-j-kiel

Your genome, every human's genome, consists of a unique DNA sequence of A's, T's, C's and G's that tell your cells how to operate. Thanks to technological advances, scientists are now able to know the sequence of letters that makes up an individual genome relatively quickly and inexpensively. Mark J. Kiel takes an in-depth look at the science behind the sequence.

Lesson by Mark J. Kiel, animation by Marc Christoforidis.]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</guid>
	<pubDate>Mon, 04 Jun 2018 03:45:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36857/%E2%80%9Cone-code-to-find-them-all%E2%80%9D-a-perl-tool-to-conveniently-parse-repeatmasker-output-files</link>
	<title><![CDATA[“One code to find them all”: a perl tool to conveniently parse RepeatMasker output files]]></title>
	<description><![CDATA[One code to find them all is a set of perl scripts to extract useful information from RepeatMasker about transposable elements, retrieve their sequences and get some quantitative information.

Assemble RepeatMasker hits into complete TE copies, including LTR-retrotransposon
Retrieve corresponding TE sequences, and flanking sequences, from the local fasta files
Compute summary statistics for each TE family (number of TE copies, genome coverage...)
Ambiguous cases such as nested TE can be assembled into copies automatically or manually
Allow for working with a TE user-defined library
Allow for working with only a user-chosen set of TE families


http://doua.prabi.fr/software/one-code-to-find-them-all<p>Address of the bookmark: <a href="http://doua.prabi.fr/software/one-code-to-find-them-all" rel="nofollow">http://doua.prabi.fr/software/one-code-to-find-them-all</a></p>]]></description>
	<dc:creator>Poonam Mahapatra</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/11354/genomics-and-personalized-medicine</guid>
	<pubDate>Sun, 01 Jun 2014 23:38:42 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/11354/genomics-and-personalized-medicine</link>
	<title><![CDATA[Genomics and Personalized Medicine]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/pgHAXCMMcro" frameborder="0" allowfullscreen></iframe>(October 20, 2009) Michael Snyder, Professor of Genetics and Chair of the Department of Genetics at Stanford, discusses advances in gene sequencing, the impact of genomics on medicine, the potential for personalized medicine. and efforts at Stanford to further study these issues.

Stanford Mini Med School is a series arranged and directed by Stanford's School of Medicine, and presented by the Stanford Continuing Studies program. Featuring more than thirty distinguished, faculty, scientists and physicians from Stanford's medical school, the series offers students a dynamic introduction to the world of human biology, health and disease, and the groundbreaking changes taking place in medical research and health care.

Stanford University
http://www.stanford.edu

Stanford University School of Medicine
http://med.stanford.edu

Stanford Continuing Studies
http://continuingstudies.stanford.edu

Stanford University Channel on YouTube:
http://www.youtube.com/stanford]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</guid>
	<pubDate>Fri, 15 Jun 2018 04:01:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36950/salsa-a-tool-to-scaffold-long-read-assemblies-with-hi-c</link>
	<title><![CDATA[SALSA: A tool to scaffold long read assemblies with Hi-C]]></title>
	<description><![CDATA[This code is used to scaffold your assemblies using Hi-C data. This version implements some improvements in the original SALSA algorithm. If you want to use the old version, it can be found in the old_salsa branch.

To use the latest version, first run the following commands:

  cd SALSA
  make
To run the code, you will need Python 2.7, BOOST libraries and Networkx(version lower than 1.2).

If you consider using this tool, please cite our publication which describes the methods used for scaffolding.

Ghurye, J., Pop, M., Koren, S., Bickhart, D., &amp; Chin, C. S. (2017). Scaffolding of long read assemblies using long range contact information. BMC genomics, 18(1), 527. Link

Ghurye, J., Rhie, A., Walenz, B.P., Schmitt, A., Selvaraj, S., Pop, M., Phillippy, A.M. and Koren, S., 2018. Integrating Hi-C links with assembly graphs for chromosome-scale assembly. bioRxiv, p.261149 Link

For any queries, please either ask on github issue page or send an email to Jay Ghurye (jayg@cs.umd.edu).<p>Address of the bookmark: <a href="https://github.com/machinegun/SALSA" rel="nofollow">https://github.com/machinegun/SALSA</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/11434/adhoc-bioinformatics-faculty-position-nit</guid>
  <pubDate>Tue, 03 Jun 2014 16:19:52 -0500</pubDate>
  <link></link>
  <title><![CDATA[Adhoc Bioinformatics Faculty Position @ NIT]]></title>
  <description><![CDATA[
<p>NATIONAL INSTITUTE OF TECHNOLOGY, DEPARTMENT OF BIOTECHNOLOGY, WARANGAL – 506 021, Andhra Pradesh</p>

<p>No.NITW/BT/2014/adhoc</p>

<p>APPLICATIONS ARE INVITED FOR THE APPOINTMENT OF ADHOC FACULTY ON CONTRACT BASIS IN THE DEAPARTMENT OF BIOTECHNOLOGY</p>

<p>Period of Contract: Initially the appointment is for one semester i.e., from July 2014 up to December 2014 only.</p>

<p>Essential Qualifications:</p>

<p>i) B. Tech or equivalent in Biotechnology/ Industrial Biotechnology/ Biochemical Engineering / Chemical Engg. Or M. Sc in Microbiology/ Botany/ Zoology/ Biochemistry/Biotechnology and ii) M. Tech or equivalent in Biotechnology/Industrial Biotechnology/Bioinformatics</p>

<p>Or</p>

<p>Integrated M. Tech in Biotechnology/Industrial Biotechnology/ Bioinformatics</p>

<p>Candidates must possess First class (60% aggregate marks or 6.5 CGPA) at B. Tech/ M. Sc and M. Tech.</p>

<p>Desirable: Ph. D Pay Package: All selected candidates shall be eligible for a consolidated pay of Rs.30, 000/- per month. Candidates with Ph. D shall be eligible for an additional amount of Rs.5, 000/- per month.</p>

<p>How to apply : Applications on plain paper with attested photocopies of certificate and bio data along with justification for eligibility should reach to the Head, Department of Biotechnology, National Institute of Technology, Warangal AP 506004 in the form of soft or hard copy on or before 21st June 2014 email : biotech_hod@nitw.ac.in</p>

<p>Intimation: No separate call letters will be sent to the candidates. All the eligible candidates will be notified in the institute web site on 23rd June 2014. All the eligible candidates are requested to report for the interview to the Head, Department of Biotechnology at 9:00 AM on 27th June 2014</p>

<p>Joining: Selected candidates will be informed and they are expected to join immediately.</p>

<p>Advertisement:</p>

<p>http://www.nitw.ac.in/nitw/announcements/2014/Bio-Adhoc%20Advt.%20May-2014.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</guid>
	<pubDate>Mon, 06 Aug 2018 17:19:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37496/gsearch-a-fast-and-flexible-general-search-tool-for-whole-genome-sequencing</link>
	<title><![CDATA[gSearch: a fast and flexible general search tool for whole-genome sequencing]]></title>
	<description><![CDATA[<p><span>gSearch compares sequence variants in the Genome Variation Format (GVF) or Variant Call Format (VCF) with a pre-compiled annotation or with variants in other genomes. Its search algorithms are subsequently optimized and implemented in a multi-threaded manner.&nbsp;</span></p><p>Address of the bookmark: <a href="http://ml.ssu.ac.kr/gSearch/index.html" rel="nofollow">http://ml.ssu.ac.kr/gSearch/index.html</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/11735/search-shell-command-history</guid>
	<pubDate>Thu, 12 Jun 2014 17:43:34 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/11735/search-shell-command-history</link>
	<title><![CDATA[Search Shell Command History]]></title>
	<description><![CDATA[<p>We use couple of hundreads of command in daily basis. Most of them are actually repeated several time. The question remain open how do I search old command history under bash shell and modify or reuse it? <br /><br />Now a days almost all modern shell allows you to search command history if enabled by user. Use history command to display the history list with line numbers. Lines listed with with a * have been modified by user.</p><p><br /><strong>Shell history search command</strong><br /><br />Type history at a shell prompt:<br />$ history</p><p>It will display the list of all used commandline history with an serial number.<br /><br />To search particular command, enter:<br />$ history | grep command-name<br />$ history | egrep -i 'scp|ssh|ftp'<br />Emacs Line-Edit Mode Command History Searching<br /><br />To get previous command containing string, hit [CTRL]+[r] followed by search string:<br /><br />(reverse-i-search): <br /><br />To get previous command, hit [CTRL]+[p]. You can also use up arrow key.<br /><br />CTRL-p<br /><br />To get next command, hit [CTRL]+[n]. You can also use down arrow key.<br /><br />CTRL-n<br /><br /></p><p><strong>fc command</strong></p><p>Apart from hostory command there are fc command to extract the command from history. The fc stands for either "find command" or "fix command.</p><p>For example list last 10 command, enter:<br />$ fc -l 10<br />To list commands 130 through 150, enter:<br />$ fc -l 130 150<br />To list all commands since the last command beginning with ssh, enter:<br />$ fc -l ssh<br />You can edit commands 1 through 5 using vi text editor, enter:<br />$ fc -e vi 1 5</p><p><strong>Delete command history</strong><br /><br />The -c option causes the history list to be cleared by deleting all of the entries:<br />$ history -c</p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</guid>
	<pubDate>Thu, 06 Sep 2018 16:21:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37643/lorma-a-tool-for-correcting-sequencing-errors-in-long-reads</link>
	<title><![CDATA[LoRMA: A tool for correcting sequencing errors in long reads]]></title>
	<description><![CDATA[<p><span>An error correction method that uses long reads only. The method consists of two phases: first, we use an iterative alignment-free correction method based on de Bruijn graphs with increasing length of&nbsp;</span><em>k</em><span>-mers, and second, the corrected reads are further polished using long-distance dependencies that are found using multiple alignments. According to our experiments, the proposed method is the most accurate one relying on long reads only for read sets with high coverage. Furthermore, when the coverage of the read set is at least 75&times;, the throughput of the new method is at least 20% higher.</span></p>
<blockquote>
<p><span>conda install -c atgc-montpellier lorma</span></p>
</blockquote><p>Address of the bookmark: <a href="https://gite.lirmm.fr/lorma/lorma-releases/wikis/home" rel="nofollow">https://gite.lirmm.fr/lorma/lorma-releases/wikis/home</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/11609/bioinformatician%E2%80%99s-pocket-reference</guid>
	<pubDate>Sun, 08 Jun 2014 09:56:58 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/11609/bioinformatician%E2%80%99s-pocket-reference</link>
	<title><![CDATA[Bioinformatician’s Pocket Reference !!]]></title>
	<description><![CDATA[<p><span>It is amusing how brain of bioinformaticians work! Learning a new programming language for days feels so much of fun that making 5 minute discussion with neighbours (unless under special circumstances!) in our own mother-tongue. Today every bioinformatician keeps more than few languages and core IT toolkits on their plate. It has become mandatory to be able to mould different code snippets to build our own custom workflows, and thus keeping syntax at our fingertips has become essential.Although Google is best way to get syntax problem solved, it is not a bad idea to keep reference sheets is our smartphones or stick out some printed sheets on the back of your door, in the old fashion way!!</span></p><p>Address of the bookmark: <a href="http://infoplatter.wordpress.com/2014/04/06/bioinformaticians-pocket-reference/" rel="nofollow">http://infoplatter.wordpress.com/2014/04/06/bioinformaticians-pocket-reference/</a></p>]]></description>
	<dc:creator>RAJESH DETROJA</dc:creator>
</item>

</channel>
</rss>