<?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/40217?offset=60</link>
	<atom:link href="https://bioinformaticsonline.com/related/40217?offset=60" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</guid>
	<pubDate>Fri, 18 May 2018 08:28:26 -0500</pubDate>
	<link>https://bioinformaticsonline.com/pages/view/36711/ancestral-sequence-reconstruction-steps</link>
	<title><![CDATA[Ancestral sequence reconstruction steps !]]></title>
	<description><![CDATA[<div><strong>Ancestral sequence reconstruction</strong>&nbsp;(<strong>ASR</strong>) &ndash; also known as&nbsp;<strong>ancestral gene</strong>/<strong>sequence reconstruction</strong>/<strong>resurrection</strong>&nbsp;&ndash; is a technique used in the study of&nbsp;molecular evolution. The method consists of the synthesis of an ancestral&nbsp;gene&nbsp;and expression of the corresponding ancestral&nbsp;protein.&nbsp;<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-thornton-1"></a>The idea of protein 'resurrection' was suggested in 1963 by Pauling and Zuckerkandl.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-2"></a>&nbsp;Some early efforts were made in the eighties-nineties, led by the laboratory of&nbsp;Steven A. Benner, showing the potential of this technique &ndash; one that only started to be fulfilled in the post-genomic era.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-3"></a>&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.<a href="https://en.wikipedia.org/wiki/Ancestral_sequence_reconstruction#cite_note-4"></a>&nbsp;Over the last decade, ancestral protein resurrection has developed as a strategy to reveal the mechanisms and dynamics of protein evolution.&nbsp;</div><div>&nbsp;</div><div>BEAST is the best way to predict the ancestral structure. but, I suggest following steps?</div><div>&nbsp;</div><div>1- Alignments "Mafft -&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fmafft.cbrc.jp%2Falignment%2Fsoftware%2Fsource.html" target="_blank">http://mafft.cbrc.jp/alignment/software/source.html</a>"</div><div>mafft --maxiterate 1000 --reorder --thread 24 --genafpair Dataset.fasta &gt; Dataset_Alig.fasta</div><div>&nbsp;</div><div>2- Your dataset has a good phylogenetic signal, is possible to perform with Tree-Puzzle "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.tree-puzzle.de" target="_blank">http://www.tree-puzzle.de</a>";</div><div>&nbsp;</div><div id="yui_3_14_1_1_1526649596608_1443">3 - This dataset which the saturation index, I perform with "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fdambe.bio.uottawa.ca%2Fdambe.asp" target="_blank">http://dambe.bio.uottawa.ca/dambe.asp</a>";</div><div>&nbsp;</div><div>4- Has evidence of possible recombination in your dataset, the evaluate if this presence or absence, because this may to influence the grouping of clades, I perform with</div><div>---recombination</div><div>&nbsp;</div><div>4.1- Phi-test, implemented in SplitTree4"<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.splitstree.org" target="_blank">http://www.splitstree.org</a>", (.nex file)</div><div>&nbsp;</div><div>4.2- GARD deployed in webserver in the DataMonkey "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fwww.datamonkey.org%2F" target="_blank">http://www.datamonkey.org/</a>" - turning to the amino acid seaview -&gt; view proteins -&gt; save as ...) Ideally do a tree-based groups.</div><div>&nbsp;</div><div>4.3- RDP4 for download and installation on Windows in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fweb.cbio.uct.ac.za%2F~darren%2Frdp.html" target="_blank">http://web.cbio.uct.ac.za/~darren/rdp.html</a>"</div><div>&nbsp;</div><div>4.4- Hyphy (Mac, Windows, Linux) in "<a href="https://www.researchgate.net/deref/http%3A%2F%2Fhyphy.org%2Fw%2Findex.php%2FDownload" target="_blank">http://hyphy.org/w/index.php/Download</a>"</div><div>&nbsp;</div><div>4.5- Path-o-Gen (temporal structure of a tree input file -&gt; arquivo.tre)</div><div>These steps above, I call of pre-processing to inferences phylogenetic...</div><div>&nbsp;</div><div>5- Perform phylogenetic tree, used Bayesian Inference with Molecular Clock, but is necessary Clock Testing:</div><div>&nbsp;</div><div>- This step is performed with program Beast (Beauti, Beast and TreeAnnotator), and Tracer_v1.5 more FigTree to inspection.</div><div>&nbsp;</div><div>- Tutorials:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Ftutorials" target="_blank">http://beast.bio.ed.ac.uk/tutorials</a></div><div>- Downloads:&nbsp;<a href="https://www.researchgate.net/deref/http%3A%2F%2Fbeast.bio.ed.ac.uk%2Fdownloads" target="_blank">http://beast.bio.ed.ac.uk/downloads</a></div>]]></description>
	<dc:creator>Surabhi Chaudhary</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</guid>
	<pubDate>Fri, 19 Oct 2018 08:48:43 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/37962/wtdbg2-a-de-novo-sequence-assembler-for-long-noisy-reads-produced-by-pacbio-or-oxford-nanopore</link>
	<title><![CDATA[Wtdbg2: a de novo sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore]]></title>
	<description><![CDATA[<p><span>Wtdbg2 is a&nbsp;</span><em>de novo</em><span>&nbsp;sequence assembler for long noisy reads produced by PacBio or Oxford Nanopore Technologies (ONT). It assembles raw reads without error correction and then builds the consensus from intermediate assembly output. Wtdbg2 is able to assemble the human and even the 32Gb&nbsp;</span><a href="https://www.nature.com/articles/nature25458">Axolotl</a><span>&nbsp;genome at a speed tens of times faster than&nbsp;</span><a href="https://github.com/marbl/canu">CANU</a><span>&nbsp;and&nbsp;</span><a href="https://github.com/PacificBiosciences/FALCON">FALCON</a><span>while producing contigs of comparable base accuracy.</span></p><p>Address of the bookmark: <a href="https://github.com/ruanjue/wtdbg2" rel="nofollow">https://github.com/ruanjue/wtdbg2</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/39372/irnad-a-computational-tool-for-identifying-d-modification-sites-in-rna-sequence</guid>
	<pubDate>Thu, 16 May 2019 00:20:07 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/39372/irnad-a-computational-tool-for-identifying-d-modification-sites-in-rna-sequence</link>
	<title><![CDATA[iRNAD: a computational tool for identifying D modification sites in RNA sequence]]></title>
	<description><![CDATA[<p><span>iRNAD, for identifying D modification sites in RNA sequence. In this predictor, the RNA samples derived from five species were encoded by nucleotide chemical property and nucleotide density. Support vector machine was utilized to perform the classification.&nbsp;</span></p>
<p><span><a href="http://lin-group.cn/server/iRNAD/">http://lin-group.cn/server/iRNAD/</a></span></p><p>Address of the bookmark: <a href="http://lin-group.cn/server/iRNAD/" rel="nofollow">http://lin-group.cn/server/iRNAD/</a></p>]]></description>
	<dc:creator>Abhimanyu Singh</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</guid>
	<pubDate>Sat, 04 Jan 2020 01:08:09 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/40510/reps-repeat-masked-phrap-with-scaffolding-a-wgs-sequence-assembler</link>
	<title><![CDATA[RePS: Repeat-masked Phrap with scaffolding, a WGS sequence assembler]]></title>
	<description><![CDATA[<p>RePS (Repeat-masked Phrap with scaffolding), a WGS sequence assembler, that explicitly identifies exact kmer repeats from the shotgun data and removes them prior to the assembly. The established software Phrap is used to compute meaningful error probabilities for each base. Clone-end-pairing information is used to construct scaffolds that order and orient the contigs. The updated version of RePS incorporates some of the ideas introduced by Phusion on clustering</p>
<p><img src="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/bin/45793-17f1_F4TT.jpg" alt="image" style="border: 0px;"></p>
<p>More at</p>
<p><a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC186573/</a></p><p>Address of the bookmark: <a href="ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz" rel="nofollow">ftp://ftp.genomics.org.cn/pub/ricedb/Tools/RePS/RePS-IBM-AIX.tar.gz</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/41146/lofreq-a-sequence-quality-aware-ultra-sensitive-variant-caller-for-ngs-data</guid>
	<pubDate>Tue, 18 Feb 2020 03:24:22 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/41146/lofreq-a-sequence-quality-aware-ultra-sensitive-variant-caller-for-ngs-data</link>
	<title><![CDATA[LoFreq*: A sequence-quality aware, ultra-sensitive variant caller for NGS data]]></title>
	<description><![CDATA[<p>LoFreq* (i.e. LoFreq version 2) is a fast and sensitive variant-caller for inferring SNVs and indels from next-generation sequencing data. It makes full use of base-call qualities and other sources of errors inherent in sequencing (e.g. mapping or base/indel alignment uncertainty), which are usually ignored by other methods or only used for filtering.</p>
<p>https://github.com/CSB5/lofreq</p>
<p>http://csb5.github.io/lofreq/installation/</p>
<p>https://github.com/CSB5/lofreq/tree/master/dist</p><p>Address of the bookmark: <a href="http://csb5.github.io/lofreq/" rel="nofollow">http://csb5.github.io/lofreq/</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</guid>
	<pubDate>Tue, 25 Aug 2020 03:40:17 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/42160/vicuna-a-software-tool-that-enables-consensus-assembly-of-ultra-deep-sequence-derived-from-diverse-viral-or-other-heterogeneous-populations</link>
	<title><![CDATA[VICUNA: a software tool that enables consensus assembly of ultra-deep sequence derived from diverse viral or other heterogeneous populations.]]></title>
	<description><![CDATA[<p><span>VICUNA</span><span>&nbsp;is a&nbsp;</span><em>de novo</em><span>&nbsp;assembly program targeting populations with high mutation rates. It creates a single linear representation of the mixed population on which intra-host variants can be mapped. For clinical samples rich in contamination (e.g., &gt;95%), VICUNA can leverage existing genomes, if available, to assemble only target-alike reads. After initial assembly, it can also use existing genomes to perform guided merging of contigs. For each data set (e.g., Illumina paired read, 454), VICUNA outputs consensus sequence(s) and the corresponding multiple sequence alignment of constituent reads. VICUNA efficiently handles ultra-deep sequence data with tens of thousands fold coverage.</span></p>
<p><a href="http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf">http://software.broadinstitute.org/viral/docs/vicuna_v1.0.pdf</a></p><p>Address of the bookmark: <a href="https://www.broadinstitute.org/viral-genomics/vicuna" rel="nofollow">https://www.broadinstitute.org/viral-genomics/vicuna</a></p>]]></description>
	<dc:creator>biogeek</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</guid>
	<pubDate>Wed, 08 May 2024 07:32:45 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44529/contigextender-a-new-approach-to-improving-de-novo-sequence-assembly-for-viral-metagenomics-data</link>
	<title><![CDATA[ContigExtender: a new approach to improving de novo sequence assembly for viral metagenomics data]]></title>
	<description><![CDATA[<p dir="auto">ContigExtender, was developed to extend contigs, complementing de novo assembly. ContigExtender employs a novel recursive Overlap Layout Candidates (r-OLC) strategy that explores multiple extending paths to achieve longer and highly accurate contigs. ContigExtender is effective for extending contigs significantly in in silico synthesized and real metagenomics datasets.</p>
<p dir="auto">More at&nbsp;https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7953547/</p>
<p dir="auto"><a href="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" target="_blank"><img src="https://camo.githubusercontent.com/72dc78177cd84dd0c667a2922a9fd984fb548b5ec94b11f9a547211a4adba3b1/68747470733a2f2f692e696d6775722e636f6d2f7734516944496a2e706e67" alt="extension process" title="extension process" style="border: 0px;"></a></p><p>Address of the bookmark: <a href="https://github.com/dengzac/contig-extender" rel="nofollow">https://github.com/dengzac/contig-extender</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</guid>
	<pubDate>Thu, 22 Aug 2013 09:38:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/videolist/watch/2759/dynamic-programming-alignment</link>
	<title><![CDATA[Dynamic Programming Alignment]]></title>
	<description><![CDATA[<iframe width="" height="" src="https://www.youtube-nocookie.com/embed/EWJnDMKBEv0" frameborder="0" allowfullscreen></iframe>lecture 9, Chem. C100, Spring 2013, UCLA]]></description>
	
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/30555/yaha</guid>
	<pubDate>Fri, 20 Jan 2017 05:38:05 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/30555/yaha</link>
	<title><![CDATA[YAHA]]></title>
	<description><![CDATA[<p>YAHA, a fast and flexible hash-based aligner. YAHA is as fast and accurate as BWA-SW at finding the single best alignment per query and is dramatically faster and more sensitive than both SSAHA2 and MegaBLAST at finding all possible alignments. Unlike other aligners that report all, or one, alignment per query, or that use simple heuristics to select alignments, YAHA uses a directed acyclic graph to find the optimal set of alignments that cover a query using a biologically relevant breakpoint penalty. YAHA can also report multiple mappings per defined segment of the query. We show that YAHA detects more breakpoints in less time than BWA-SW across all SV classes, and especially excels at complex SVs comprising multiple breakpoints.</p>
<p><strong>Availability:</strong> YAHA is currently supported on 64-bit Linux systems. Binaries and sample data are freely available for download from <a href="http://faculty.virginia.edu/irahall/YAHA" target="pmc_ext">http://faculty.virginia.edu/irahall/YAHA</a>.</p>
<p><strong>Contact:</strong></p>
<p>http://genome.wustl.edu/people/groups/detail/hall-lab/</p><p>Address of the bookmark: <a href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/" rel="nofollow">https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3463118/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</guid>
	<pubDate>Fri, 17 Feb 2017 08:38:32 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/31012/genomecomp</link>
	<title><![CDATA[GenomeComp]]></title>
	<description><![CDATA[<p>GenomeComp is a tool for summarizing, parsing and visualizing the genome wide sequence comparison results derived from voluminous BLAST textual output, so as to locate the rearrangements, insertions or deletions of genome segments between species or strains.<br><br>It can be easily used to compare, parsing and visualize large genomic sequences, especially closely related genomes such as inter-species or inter-strains. In addition, it can also show other sequence features like repeat sequence distributions in one whole-genome DNA sequence by comparing the genome to itself.<br><br>It is a stand-alone graphical user interface (GUI) program which runs on Linux, Unix, Mac OS X (tested on version 10.2.4 only) and Microsoft Windows platforms and is written in Perl/Tk.</p><p>Address of the bookmark: <a href="http://www.mgc.ac.cn/GenomeComp/" rel="nofollow">http://www.mgc.ac.cn/GenomeComp/</a></p>]]></description>
	<dc:creator>Jit</dc:creator>
</item>

</channel>
</rss>