<?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/14011?offset=850</link>
	<atom:link href="https://bioinformaticsonline.com/related/14011?offset=850" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44491/cgviewjs-is-a-circular-genome-viewing-tool</guid>
	<pubDate>Wed, 27 Mar 2024 11:16:24 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44491/cgviewjs-is-a-circular-genome-viewing-tool</link>
	<title><![CDATA[CGView.js is a Circular Genome Viewing tool]]></title>
	<description><![CDATA[<p>CGView.js is a&nbsp;<span>C</span>ircular&nbsp;<span>G</span>enome&nbsp;<span>View</span>ing tool for visualizing and interacting with small genomes. This software is an adaptation of the Java program&nbsp;<a href="https://paulstothard.github.io/cgview/">CGView</a>.</p>
<div>
<p>CGView.js is the genome viewer of Proksee, an expert system for genome assembly, annotation and visualization.</p>
<a href="https://proksee.ca/"></a></div>
<h1 id="features">Features</h1>
<ul>
<li>
<p>Circular and linear views of genomes</p>
</li>
<li>
<p>Capable of drawing genomes up to 10 Mbp with 1000's of features and 100's contigs</p>
</li>
<li>
<p>Smooth zooming down to the sequence level</p>
</li>
<li>
<p>Easily generate features and plots directly form the sequence (e.g. ORFs, GC-content and GC-Skew)</p>
</li>
<li>
<p>Save high resolution PNG maps up to 8000x8000px</p>
</li>
<li>
<p>Fully documented API for interacting with CGView.js maps</p>
</li>
</ul><p>Address of the bookmark: <a href="https://js.cgview.ca/" rel="nofollow">https://js.cgview.ca/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23379/jrf-in-bioinformatics-tezpur-universityn</guid>
  <pubDate>Fri, 17 Jul 2015 19:42:22 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF in Bioinformatics @ Tezpur Universityn]]></title>
  <description><![CDATA[
<p>Tezpur University: Napaam – 784 028:</p>

<p>Assam Applications are invited for Walk-in-Interview for the following temporary positions in the MHRD sponsored Centre of Excellence under FAST project entitled “Machine Learning Research and Big Data Analysis” under the Principal Investigator Professor D.K. Bhattacharyya, Department of Computer Science &amp; Engineering, Tezpur University.</p>

<p>Position : Senior Research Fellows (SRFs) in the field of (i) Bioinformatics (ii) Natural Language Processing / Speech Processing (iii) Cognitive Radio Networks / Optical Networks (iv) Network Security. No. of Positions : Five (05).</p>

<p>Qualification : First class in ME / M. Tech. in CSE / IT / ECE with research experience in relevant fields of research. Candidates having valid GATE / NET score shall be preferred.</p>

<p>Fellowship : Rs. 18,000/- (Rupees Eighteen Thousand) only per month.</p>

<p>Duration : Two (02) years and may be extended depending on status of the project.</p>

<p>Position : Junior Research Fellows (JRFs) in the field of Bioinformatics</p>

<p>No. of Positions : One (01).</p>

<p>Qualification : First class in B. Tech. in CSE / IT/ ECE or MCA with consistently good academic records. Candidates with M. Tech. in CSE / IT / ECE shall be preferred.</p>

<p>Fellowship : Rs. 12,000/- (Rupees twelve Thousand) only per month.</p>

<p>Duration : Two (02) years and may be extended depending on status of the project.</p>

<p>Interested candidates may send their application on plain paper by post along with his/her educational qualifications, research experience certificates (for Senior Research Fellow), 02 copies of recent passport/stamp size photograph and contact phone number to Prof. D.K. Bhattacharyya, Principal Investigator, Department of Computer Science &amp; Engineering, Tezpur University, Napaam- 784028 or mail it to dkb@tezu.ernet.in (or to smh@tezu.ernet.in) within 15 days of publication of this advertisement.</p>

<p>Advertisement: www.tezu.ernet.in/ProjectWalkin/Advt_CoE_5816-A.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44722/step-by-step-guide-to-running-genome-assembly</guid>
	<pubDate>Fri, 13 Dec 2024 11:35:55 -0600</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44722/step-by-step-guide-to-running-genome-assembly</link>
	<title><![CDATA[Step-by-Step Guide to Running Genome Assembly]]></title>
	<description><![CDATA[<p>Genome assembly is a critical process in bioinformatics, enabling the reconstruction of an organism's genome from short DNA sequence reads. Whether you&rsquo;re working on a new microbial genome or a complex eukaryotic organism, this guide will walk you through the steps of genome assembly using state-of-the-art tools and best practices.</p><h4><strong>What is Genome Assembly?</strong></h4><p>Genome assembly involves piecing together short DNA sequence reads generated by sequencing platforms (e.g., Illumina, PacBio, Oxford Nanopore) into longer, contiguous sequences called contigs. This can be performed as:</p><ul>
<li><strong>De Novo Assembly</strong>: Without a reference genome.</li>
<li><strong>Reference-Guided Assembly</strong>: Using a reference genome to guide the assembly process.</li>
</ul><h4><strong>Step 1: Preparing Your Data</strong></h4><p>Before starting the assembly, ensure that your raw sequencing data is high quality.</p><ol>
<li>
<p><strong>Input Data</strong></p>
<ul>
<li><strong>Short Reads</strong>: Illumina sequencing generates short, accurate reads ideal for scaffolding.</li>
<li><strong>Long Reads</strong>: PacBio and Nanopore sequencing provide long reads for resolving repetitive regions.</li>
</ul>
</li>
<li>
<p><strong>Quality Control (QC)</strong><br />Use tools like <strong>FastQC</strong> or <strong>MultiQC</strong> to assess the quality of your reads:</p>
<div>
<div dir="ltr"><code>fastqc reads.fastq multiqc . </code></div>
</div>
<p>Look for issues like low-quality bases, adapter contamination, or overrepresented sequences.</p>
</li>
<li>
<p><strong>Read Trimming and Filtering</strong><br />Trim low-quality bases and adapters using <strong>Trimmomatic</strong> or <strong>Cutadapt</strong>:</p>
<div>
<div dir="ltr"><code>trimmomatic PE reads_R1.fastq reads_R2.fastq trimmed_R1.fastq trimmed_R2.fastq \ ILLUMINACLIP:adapters.fa:2:30:10 LEADING:3 TRAILING:3 SLIDINGWINDOW:4:20 MINLEN:36 </code></div>
</div>
</li>
</ol><h4><strong>Step 2: Choosing an Assembly Strategy</strong></h4><p>Select an assembly strategy based on your data type:</p><ul>
<li>
<p><strong>Short-Read Assemblers</strong>:</p>
<ul>
<li>SPAdes: Popular for microbial genomes.</li>
<li>Velvet: Fast for smaller genomes.</li>
</ul>
</li>
<li>
<p><strong>Long-Read Assemblers</strong>:</p>
<ul>
<li>Canu: Ideal for long-read datasets.</li>
<li>Flye: Versatile for small and large genomes.</li>
</ul>
</li>
<li>
<p><strong>Hybrid Assemblers</strong>:</p>
<ul>
<li>MaSuRCA: Combines short and long reads.</li>
<li>Unicycler: Optimized for bacterial genomes.</li>
</ul>
</li>
</ul><h4><strong>Step 3: Running the Assembly</strong></h4><h5><strong>3.1. SPAdes (Short-Read Assembly)</strong></h5><p>SPAdes is an excellent choice for small genomes, such as bacteria.</p><div><div dir="ltr"><code>spades.py -1 trimmed_R1.fastq -2 trimmed_R2.fastq -o spades_output </code></div></div><p>The output includes assembled contigs (<code>contigs.fasta</code>) and scaffolds (<code>scaffolds.fasta</code>).</p><h5><strong>3.2. Canu (Long-Read Assembly)</strong></h5><p>Canu is designed for high-error long reads from PacBio or Nanopore.</p><div><div dir="ltr"><code>canu -p genome -d canu_output genomeSize=4.7m -nanopore-raw reads.fastq </code></div></div><p>The output will be in <code>canu_output/genome.contigs.fasta</code>.</p><h5><strong>3.3. Hybrid Assembly with Unicycler</strong></h5><p>Unicycler combines short and long reads for improved assemblies.</p><div><div dir="ltr"><code>unicycler -1 trimmed_R1.fastq -2 trimmed_R2.fastq -l long_reads.fastq -o unicycler_output </code></div></div><h4><strong>Step 4: Assessing Assembly Quality</strong></h4><p>After assembly, evaluate its quality using the following tools:</p><ol>
<li>
<p><strong>QUAST</strong><br />QUAST generates assembly statistics, such as N50, genome size, and GC content:</p>
<div>
<div dir="ltr"><code>quast contigs.fasta -o quast_output </code></div>
</div>
</li>
<li>
<p><strong>BUSCO</strong><br />BUSCO checks genome completeness by identifying conserved genes:</p>
<div>
<div dir="ltr"><code>busco -i contigs.fasta -o busco_output -l fungi_odb10 -m genome </code></div>
</div>
</li>
<li>
<p><strong>Assembly Graph Visualization</strong><br />Visualize assembly graphs with <strong>Bandage</strong>:</p>
<div>
<div dir="ltr"><code>Bandage load assembly_graph.gfa </code></div>
</div>
</li>
</ol><hr><h4><strong>Step 5: Post-Assembly Steps</strong></h4><ol>
<li>
<p><strong>Polishing</strong><br />Improve assembly accuracy using tools like <strong>Pilon</strong> (for short reads) or <strong>Racon</strong> (for long reads).</p>
<div>
<div dir="ltr"><code>racon long_reads.fasta mapped_reads.sam contigs.fasta &gt; polished_contigs.fasta </code></div>
</div>
</li>
<li>
<p><strong>Scaffolding</strong><br />Link contigs into scaffolds using tools like <strong>SSPACE</strong> or <strong>Opera-LG</strong> if required.</p>
</li>
<li>
<p><strong>Annotation</strong><br />Annotate the assembled genome using <strong>Prokka</strong> for prokaryotes or <strong>Maker</strong> for eukaryotes.</p>
<div>
<div dir="ltr"><code>prokka --outdir annotation_output --prefix genome contigs.fasta </code></div>
</div>
</li>
</ol><h4><strong>Step 6: Sharing and Archiving</strong></h4><ol>
<li>
<p><strong>Submit to Public Repositories</strong><br />Share your assembly in databases like <strong>NCBI GenBank</strong>, <strong>ENA</strong>, or <strong>DDBJ</strong>.</p>
</li>
<li>
<p><strong>Metadata Preparation</strong><br />Include detailed metadata for your submission, such as organism name, sequencing platform, and coverage.</p>
</li>
</ol><h4><strong>Best Practices</strong></h4><ul>
<li>Always perform quality checks at each stage to ensure data integrity.</li>
<li>Use multiple tools to cross-validate results when working with complex genomes.</li>
<li>Document parameters and software versions for reproducibility.</li>
</ul><h4><strong>Conclusion</strong></h4><p>Genome assembly is a powerful process that transforms raw sequencing data into a coherent representation of an organism&rsquo;s genome. By following this step-by-step guide, you can successfully assemble genomes and uncover valuable biological insights. Whether you&rsquo;re assembling a microbial genome or tackling the complexities of a eukaryotic genome, these tools and strategies will set you on the path to success.</p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23493/srf-post-in-nehu-shillong</guid>
  <pubDate>Sat, 25 Jul 2015 20:09:50 -0500</pubDate>
  <link></link>
  <title><![CDATA[SRF post in NEHU, Shillong]]></title>
  <description><![CDATA[
<p>Dept of Biochemistry<br />North-Eastern Hill University<br />Umshing, Shillong- 793 022</p>

<p>Applications are invited for the post of Senior Research Fellow- SRF (one) and Junior Research Fellow- JRF (one) to be appointed in a SERB-funded major research project entitled “Biochemical and functional properties of Synechocystis Glutathione S-transferase(s)” sanctioned to Dr. Timir Tripathi, Molecular and Structural Biophysics Laboratory, Department of Biochemistry, NEHU, Shillong.</p>

<p>Essential Qualifications: For both positions M.Sc. or equivalent with a good academic record is a prerequisite.</p>

<p>For Project-SRF, experience in bioinformatics/computational biology is required, which should be evident by publications.</p>

<p>Students waiting for their last semester result can apply for JRF position.</p>

<p>Stipend: As per SERB norms.</p>

<p>Interested students can email their detailed bio-data including mobile number and recent photograph to msb.biochem@gmail.com, latest by 01.08.15. The hard copy is not required at this stage.</p>

<p>The date of interview will be informed after primary scrutiny of the applications. No TA/DA will be paid if called for interview. P.S: Students applied for the same post as per date 01.06.15, need not to apply again as their application will be considered in this advertisement also.</p>

<p>For details of the research work of the PI’s group kindly visit www.ttripathi.webs.com</p>

<p>Dr. Timir Tripathi Principal Investigator DST-SERB Project Department of Biochemistry NEHU, Shillong</p>

<p>Advertisement: www.nehu.ac.in/Advertisements/BiochemPVAdvtTT_200715.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</guid>
	<pubDate>Sat, 20 Sep 2025 09:34:04 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44902/hite-a-fast-and-accurate-dynamic-boundary-adjustment-approach-for-full-length-transposable-elements-detection-and-annotation-in-genome-assemblies</link>
	<title><![CDATA[HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies]]></title>
	<description><![CDATA[<p dir="auto"><code>HiTE</code>&nbsp;is a Python software that uses a dynamic boundary adjustment approach to detect and annotate full-length Transposable Elements in Genome Assemblies. In comparison to other tools, HiTE demonstrates superior performance in detecting a greater number of full-length TEs.</p>
<div dir="auto">
<h2 dir="auto">panHiTE</h2>
<a href="https://github.com/CSU-KangHu/HiTE#panhite"></a></div>
<p dir="auto">We have developed panHiTE, a comprehensive and accurate pipeline for TE detection in large-scale population genomes. It has been successfully applied to hundreds of plant population genomes, demonstrating its effectiveness and scalability.</p>
<p dir="auto">For detailed instructions, please refer to the&nbsp;<a href="https://github.com/CSU-KangHu/HiTE/wiki/panHiTE-tutorial">panHiTE tutorial</a>.</p><p>Address of the bookmark: <a href="https://github.com/CSU-KangHu/HiTE" rel="nofollow">https://github.com/CSU-KangHu/HiTE</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/23673/ra-bioinformatics-at-alagappa-university</guid>
  <pubDate>Sat, 08 Aug 2015 01:36:35 -0500</pubDate>
  <link></link>
  <title><![CDATA[RA Bioinformatics at Alagappa University]]></title>
  <description><![CDATA[
<p>RA Bioinformatics</p>

<p>Eligibility : MSc(Bio-Chemistry, Bio-Informatics, Bio-Tech)</p>

<p>Location : Chennai</p>

<p>Last Date : 20 Aug 2015</p>

<p>Hiring Process : Walk - In<br />Alagappa University - Job Details</p>

<p>RA Bioinformatics Job position in Alagappa University</p>

<p>Qualification: M.Sc., in Bioinformatics/Biotechnology/Biophysics/Biochemistry/ Life Sciences</p>

<p>No.of Post: One</p>

<p>Salary : Rs. 11000<br />How to apply</p>

<p>A walk-in Interview will be held at the Department of Biotechnology, Alagappa University, Science Campus, Karaikudi 630 004 on 20.08.2015 (Thursday) at 10.30 AM.</p>

<p>Interested candidates are encouraged to send their Curriculum Vitae by email in advance. On the day of interview, the candidates must produce original certificates in proof of their educational qualification and experience and a recommendation letter from the Head of the Department/Institution where last studied/worked. Candidates who have already passed the required Degree alone are eligible to appear for interview.</p>

<p>Click Here for more http://alagappauniversity.ac.in/files/news_files/Notification.pdf</p>
]]></description>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</guid>
	<pubDate>Fri, 04 Sep 2026 04:14:14 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45273/a-subway-map-for-the-genome</link>
	<title><![CDATA[A Subway Map for the Genome]]></title>
	<description><![CDATA[<p>Maya was looking at a genome graph on her computer. There were nodes, branches, and paths going in every direction.</p><p>&ldquo;It&rsquo;s like a subway map,&rdquo; she said, &ldquo;but for DNA.&rdquo;</p><p>That idea is exactly what Sequence Tube Map brings to life.</p><p>Instead of showing a genome as one long, confusing sequence, it displays different genomic paths like routes on a metro map. Where sequences are shared, the paths travel together. Where genetic variation occurs, they branch into different routes and may join again later.</p><p>This makes complex genome graphs much easier to explore.</p><p>Maya could now see how different haplotypes moved through the same genomic region and where they took different paths. She could even view sequencing reads mapped onto the graph, helping her understand what was happening in regions with genetic variation.</p><p>What once looked like a tangled network now looked like a journey.</p><p>Sequence Tube Map turns the complexity of graph genomes into a visual story&mdash;making it easier for scientists to see how DNA can take different routes.</p><p>Read more at&nbsp; https://github.com/vgteam/sequencetubemap&nbsp;</p><p>and</p><p>https://academic.oup.com/bioinformatics/article/35/24/5318/5542397</p><p>Demo at&nbsp;https://vgteam.github.io/sequenceTubeMap/</p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/23892/bioinformatics-made-easy-search-bioinformatics-tools-and-run-genomic-analysis-in-the-cloud</guid>
	<pubDate>Thu, 20 Aug 2015 02:21:20 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/23892/bioinformatics-made-easy-search-bioinformatics-tools-and-run-genomic-analysis-in-the-cloud</link>
	<title><![CDATA[Bioinformatics Made Easy Search: Bioinformatics tools and run genomic analysis in the cloud]]></title>
	<description><![CDATA[<p>InsideDNA makes hundreds of bioinformatics tools immediately available to run via an easy-to-use web interface and allows an accurate search across all functions, tools and pipelines.</p>
<p>With InsideDNA, you can upload and store your own genomic/genetic datasets in a limitless cloud space, and instantly analyze it with a powerful compute instance, without any tool installation or set up hassle.</p>
<p>More at https://insidedna.me/</p><p>Address of the bookmark: <a href="https://insidedna.me/" rel="nofollow">https://insidedna.me/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</guid>
	<pubDate>Fri, 11 Sep 2026 13:00:36 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/45306/the-genes-that-travel-together-a-genomic-detective-story</link>
	<title><![CDATA[The Genes That Travel Together: A Genomic Detective Story]]></title>
	<description><![CDATA[<p>Imagine looking through thousands of microbial genomes and discovering two genes that repeatedly appear together. The obvious conclusion is that they must somehow be connected&mdash;that perhaps they work together, participate in the same pathway, or depend on each other. But evolution has a way of leaving misleading clues. What if these two genes are found together simply because they were inherited from the same ancient ancestor? In that case, their apparent association may have little to do with their biological function; it may simply be a reflection of shared evolutionary history. This is the intriguing problem addressed by CORGIAS (https://github.com/ynishimuraLv/corgias), a computational framework developed to distinguish genuine gene associations from correlations created by common ancestry.</p><p>Instead of asking only whether two genes occur together across genomes, CORGIAS asks a deeper question: did these genes actually evolve together, repeatedly gaining or losing their presence in concert, or are they merely travelling together because of their inherited history? The framework introduces two complementary approaches, Ancestral State Adjustment (ASA) and the Simultaneous EVolution test (SEV), which incorporate evolutionary information into the search for gene associations. This distinction becomes increasingly important as genome sequencing continues to uncover enormous numbers of microbial genomes, many from organisms that have never been cultured and whose genes remain functionally mysterious. In this growing genomic landscape, simply finding a gene is no longer enough&mdash;we need clues about what that gene might be doing. CORGIAS approaches this problem almost like a genomic detective: rather than treating every association as evidence, it reconstructs the evolutionary story behind the association and asks whether the evidence survives that history. By doing so, it offers a way to separate coincidence from biological connection and potentially uncover functional relationships hidden within the vast microbial genomic landscape. The broader message is beautifully simple: genes do not evolve in isolation, and understanding what they do may require us to look beyond where they are today and reconstruct how they arrived there. Sometimes, the most important clue in a genome is not the gene itself, but the evolutionary journey it has taken.</p><p>More at&nbsp;https://academic.oup.com/nargab/article/7/4/lqaf182/8377910?</p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>

<item>
  <guid isPermaLink='true'>https://bioinformaticsonline.com/opportunity/view/24036/jrf-position-%E2%80%93-international-institute-of-information-technology-hyderabad</guid>
  <pubDate>Mon, 24 Aug 2015 22:44:46 -0500</pubDate>
  <link></link>
  <title><![CDATA[JRF Position – International Institute of Information Technology, Hyderabad]]></title>
  <description><![CDATA[
<p>International Institute of Information Technology, Hyderabad</p>

<p>Center for Computational Natural Sciences and Bioinformatics</p>

<p>Junior Research Fellowship Position</p>

<p>Applications are invited for one JRF position in the following DAE sponsored project.</p>

<p>Title of the project: Insight into the Structure–Function Relationships of Chemically Modified Nucleic Acids: A Molecular Dynamics Simulations Study.</p>

<p>The above project involves theoretical modelling and simulations on chemically modified nucleic acids to investigate their structures, dynamics and thermodynamic stabilities.</p>

<p>Desired qualification: M.Sc. in Chemistry/ Bioinformatics; GATE/UGC-CSIR NET qualification.</p>

<p>To apply: Send detailed curriculum vitae by e-mail to the following address on or before 31 August 2015: Prof. U. Deva Priyakumar (devalab@iiit.ac.in), CCNSB, IIIT-H, Gachibowli, Hyderabad 500 032.</p>
]]></description>
</item>

</channel>
</rss>