<?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/41493?offset=380</link>
	<atom:link href="https://bioinformaticsonline.com/related/41493?offset=380" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/43042/bioinformatics-in-thailand</guid>
	<pubDate>Wed, 28 Apr 2021 02:04:56 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/43042/bioinformatics-in-thailand</link>
	<title><![CDATA[Bioinformatics in Thailand !]]></title>
	<description><![CDATA[<p>Our international PhD and master programs are designed for students who desire focused training in the elements of biology, computer science, and information technology needed for a successful career in the exciting new discipline of Bioinformatics &amp; Systems Biology. Students in our program will receive comprehensive training in omics analysis, database design and management, software engineering and programming (including web-based development), simulation techniques and modeling, and data integration. Each student will apply their skills to a practical project, where they will design and implement a solution to a real-world problem under the guidance of an experienced mentor in industry or academia.</p>
<p><strong>https://bioinformatics.kmutt.ac.th/about.html</strong></p>
<p>Duangrudee Tanramluk (Ajarn Wi) uses computational biology and machine learning to tackle the key to drug design problems via MANORAA webserver.</p>
<p><strong>https://mb.mahidol.ac.th/en/bioinformatics/</strong></p>
<p><strong>https://graduate.mahidol.ac.th/inter/</strong></p>
<p>This&nbsp;international&nbsp;Doctorate programme is designed to further broaden students&rsquo; knowledge in Bioinformatics and Molecular Biology to their maximum capability.&nbsp;</p>
<p><strong>http://www.mbb.psu.ac.th/programmes/phd</strong></p>
<p>Ph.D. program in Bioinformatics and Computational Biology is a joint effort of the Faculty of Science and Faculty of Medicine, Chulalongkorn University. The program has study plans for both applicants who hold a bachelor&rsquo;s degree and applicants who hold a master&rsquo;s degree in any related fields of study.</p>
<p><strong>http://www.bioinfo.sc.chula.ac.th/ph-d-program-specialization/</strong></p>
<p>Additional detail&nbsp;</p>
<p><strong>https://www.biotec.or.th/en/index.php/research/research-units/genome-technology-research-unit</strong></p>
<p><strong>https://tbrcnetwork.org/labtbrc/index.php/bioinformatics-and-chemoinformatics/</strong></p>
<p><strong>https://genomicsthailand.com/Genomic/home</strong></p><p>Address of the bookmark: <a href="https://bioinformatics.kmutt.ac.th/" rel="nofollow">https://bioinformatics.kmutt.ac.th/</a></p>]]></description>
	<dc:creator>Shruti Paniwala</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5933/virus-3d-animation</guid>
	<pubDate>Sat, 26 Oct 2013 09:01:27 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5933/virus-3d-animation</link>
	<title><![CDATA[Virus 3D Animation]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/67ays2ZYr48" frameborder="0" allowfullscreen></iframe>piranha.dl facebook site: http://www.facebook.com/home.php?#!/pages/piranhadl-3D/131721586891915]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/blog/view/44506/mosquito-species-known-for-transmitting-the-dengue-virus</guid>
	<pubDate>Wed, 03 Apr 2024 00:05:51 -0500</pubDate>
	<link>https://bioinformaticsonline.com/blog/view/44506/mosquito-species-known-for-transmitting-the-dengue-virus</link>
	<title><![CDATA[Mosquito species known for transmitting the Dengue virus]]></title>
	<description><![CDATA[<p><span>Here is a list of mosquito species known for transmitting the Dengue virus along with essential and applied information about each species:</span><br /><br /><span>1. Aedes aegypti:</span><br /><span>- Geographical Distribution: Found in tropical and subtropical regions worldwide.</span><br /><span>- Biting Behavior: Daytime biter, prefers feeding indoors, often around human dwellings.</span><br /><span>- Role in Dengue Transmission: Primary vector responsible for transmitting Dengue virus to humans.</span><br /><br /><span>2. Aedes albopictus (Asian tiger mosquito):</span><br /><span>- Geographical Distribution: Found in tropical, subtropical, and temperate regions worldwide.</span><br /><span>- Biting Behavior: Daytime biter, feeds both indoors and outdoors, aggressive feeder.</span><br /><span>- Role in Dengue Transmission: Secondary vector, can transmit Dengue virus to humans.</span><br /><br /><span>3. Aedes polynesiensis:</span><br /><span>- Geographical Distribution: Found in Pacific Islands and coastal regions.</span><br /><span>- Biting Behavior: Daytime biter, prefers feeding outdoors, often near coastal areas.</span><br /><span>- Role in Dengue Transmission: Vector of Dengue virus in specific geographic regions.</span><br /><br /><span>4. Aedes scutellaris:</span><br /><span>- Geographical Distribution: Found in Southeast Asia, Pacific Islands, and coastal regions.</span><br /><span>- Biting Behavior: Daytime feeder, active in shaded areas, prefers outdoor environments.</span><br /><span>- Role in Dengue Transmission: Vector of Dengue virus, particularly in coastal areas.</span><br /><br /><span>5. Aedes africanus:</span><br /><span>- Geographical Distribution: Found in parts of Africa, including forested areas.</span><br /><span>- Biting Behavior: Daytime feeder, prefers shaded areas, bites humans and other animals.</span><br /><span>- Role in Dengue Transmission: Vector of Dengue virus in African regions.</span><br /><br /><span>Understanding the geographical distribution and biting behavior of these mosquito species is crucial for implementing effective control and prevention strategies to reduce Dengue virus transmission.</span></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/5731/influenza-animation-flu-virus-mechanism</guid>
	<pubDate>Thu, 17 Oct 2013 19:43:13 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/5731/influenza-animation-flu-virus-mechanism</link>
	<title><![CDATA[Influenza animation - flu virus mechanism]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/YSgkoldBNkI" frameborder="0" allowfullscreen></iframe>Animation of the mechanism of an influenza virus and how Crucell's antibodies target the HA1 proteins on the virus and prevent further spread of influenza. 

Client: Crucell
Direction, Design & Animation: Daniel Lim, 2Preform
Music & Sound Design: Javier Barrero, Logical Disorder
Production Company: David Hager, All Terrain Media]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</guid>
	<pubDate>Wed, 21 Aug 2013 07:56:01 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/2726/comparison-of-short-read-de-novo-alignment-algorithms</link>
	<title><![CDATA[Comparison of Short Read De Novo Alignment Algorithms]]></title>
	<description><![CDATA[<p>Excellent article to introduce different sequencing methods along with tools for de novo assembly of sequencing reads and their relevant references.</p>
<p>Title:&nbsp;<strong>Comparison of Short Read De Novo Alignment Algorithms&nbsp;</strong></p>
<p>Author<strong>: Nikhil Gopal</strong></p><p>Address of the bookmark: <a href="http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf" rel="nofollow">http://biochem218.stanford.edu/Projects%202011/Gopal%202011.pdf</a></p>]]></description>
	<dc:creator>Rahul Agarwal</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</guid>
	<pubDate>Tue, 05 Jun 2018 09:57:11 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/36865/perga-a-paired-end-read-guided-de-novo-assembler-for-extending-contigs-using-svm-and-look-ahead-approach</link>
	<title><![CDATA[PERGA: A Paired-End Read Guided De Novo Assembler for Extending Contigs Using SVM and Look Ahead Approach]]></title>
	<description><![CDATA[PERGA - Paired End Reads Guided Assembler

PERGA is a novel sequence reads guided de novo assembly approach which adopts greedy-like prediction strategy for assembling reads to contigs and scaffolds. Instead of using single-end reads to construct contig, PERGA uses paired-end reads and different read overlap sizes from O ≥ Omax to Omin to resolve the gaps and branches. Moreover, by constructing a decision model using machine learning approach based on branch features, PERGA can determine the correct extension in 99.7% of cases. PERGA will try to extend the contigs by all feasible nucleotides and determine if these multiple extensions due to sequencing errors or repeats by using looking ahead technology, and it also try to separate the different repeats of nearby genomic regions to make the assembly result more longer and accurate.

The simulated E.coli paired-end reads data are generated using GemSim (KE McElroy, F Luciani, T Thomas. Gemsim: General, Error-Model Based Simulator of Next-Generation Sequencing Data. BMC Genomics 2012, 13:74), with coverage 50x, 60x, 100x, read lengths 100-bp, and can be downloaded from https://github.com/zhuxiao/data_PERGA.<p>Address of the bookmark: <a href="https://github.com/hitbio/PERGA" rel="nofollow">https://github.com/hitbio/PERGA</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</guid>
	<pubDate>Tue, 03 Jul 2018 04:09:46 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37221/asplice-a-scalable-and-memory-efficient-algorithm-for-de-novo-transcriptome-assembly</link>
	<title><![CDATA[ASplice: a scalable and memory-efficient algorithm for de novo transcriptome assembly]]></title>
	<description><![CDATA[With increased availability of de novo assembly algorithms, it is feasible to study entire transcriptomes of non-model organisms. While algorithms are available that are specifically designed for performing transcriptome assembly from high-throughput sequencing data, they are very memory-intensive, limiting their applications to small data sets with few libraries.

Texas A&amp;M University researchers develop a transcriptome assembly algorithm that recovers alternatively spliced isoforms and expression levels while utilizing as many RNA-Seq libraries as possible that contain hundreds of gigabases of data. New techniques are developed so that computations can be performed on a computing cluster with moderate amount of physical memory.

Availability – A software program that implements the algorithm is available at: http://faculty.cse.tamu.edu/shsze/asplice.

Sze SH, Pimsler ML, Tomberlin JK, Jones CD, Tarone AM. (2017) A scalable and memory-efficient algorithm for de novo transcriptome assembly of non-model organisms. BMC Genomics 18(Suppl 4):387.<p>Address of the bookmark: <a href="http://faculty.cse.tamu.edu/shsze/asplice/" rel="nofollow">http://faculty.cse.tamu.edu/shsze/asplice/</a></p>]]></description>
	<dc:creator>Rahul Nayak</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</guid>
	<pubDate>Wed, 14 Nov 2018 04:50:27 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38212/megahit-an-ultra-fast-single-node-solution-for-large-and-complex-metagenomics-assembly-via-succinct-de-bruijn-graph</link>
	<title><![CDATA[MEGAHIT: an ultra-fast single-node solution for large and complex metagenomics assembly via succinct de Bruijn graph]]></title>
	<description><![CDATA[<p><span>MEGAHIT is a single node assembler for large and complex metagenomics NGS reads, such as soil. It makes use of succinct&nbsp;</span><em>de Bruijn</em><span>&nbsp;graph (SdBG) to achieve low memory assembly. MEGAHIT can&nbsp;</span><span>optionally</span><span>&nbsp;utilize a CUDA-enabled GPU to accelerate its SdBG contstruction. The GPU-accelerated version of MEGAHIT has been tested on NVIDIA GTX680 (4G memory) and Tesla K40c (12G memory) with CUDA 5.5, 6.0 and 6.5. MEGAHIT v1.0 or greater also supports IBM Power PC and has been tested on IBM POWER8.</span></p>
<p><span>https://academic.oup.com/bioinformatics/article/31/10/1674/177884</span></p><p>Address of the bookmark: <a href="https://github.com/voutcn/megahit" rel="nofollow">https://github.com/voutcn/megahit</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</guid>
	<pubDate>Thu, 24 Jan 2019 10:35:12 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/38792/nxrepair-error-correction-in-de-novo-assemblies-using-nextera-mate-pair-reads</link>
	<title><![CDATA[NxRepair: error correction in de novo assemblies using Nextera Mate Pair Reads]]></title>
	<description><![CDATA[<p>NxRepair is a python module that automatically detects large structural errors in de novo assemblies using Nextera mate pair reads. The decector will break a contig at the site of an identified misassembly and will generate a new fasta file containing both the corrected contigs and the correct, unaffected contigs.</p>
<p>https://nxrepair.readthedocs.io/en/latest/tutorial.html</p>
<div>
<div>
<div id="js-repo-pjax-container">
<div>
<div>
<div id="readme">
<div>
<div>
<pre>nxrepair aligned_matepairs.bam assemblyfasta.fasta error_locations.csv new_fasta.fasta</pre>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
</div>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://github.com/rebeccaroisin/nxrepair" rel="nofollow">https://github.com/rebeccaroisin/nxrepair</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</guid>
	<pubDate>Tue, 05 Mar 2019 10:00:57 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39098/sda-long-read-sequence-and-assembly-of-segmental-duplications</link>
	<title><![CDATA[SDA: Long-read sequence and assembly of segmental duplications]]></title>
	<description><![CDATA[<p><span><span>Segmental Duplication Assembler (SDA; https://github.com/mvollger/SDA) constructs graphs in which paralogous sequence variants define the nodes and long-read sequences provide attraction and repulsion edges, enabling the partition and assembly of long reads corresponding to distinct paralogs.<br></span></span></p>
<p><span><span>https://github.com/mvollger/SDA</span></span></p><p>Address of the bookmark: <a href="https://www.nature.com/articles/s41592-018-0236-3" rel="nofollow">https://www.nature.com/articles/s41592-018-0236-3</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>