<?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: All site bookmarks]]></title>
	<link>https://bioinformaticsonline.com/bookmarks/all?offset=10</link>
	<atom:link href="https://bioinformaticsonline.com/bookmarks/all?offset=10" rel="self" type="application/rss+xml" />
	<description><![CDATA[]]></description>
	
	<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</guid>
	<pubDate>Thu, 28 Aug 2025 02:56:35 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44887/alfapang-alignment-free-algorithm-for-pangenome-graph-construction</link>
	<title><![CDATA[AlfaPang: alignment free algorithm for pangenome graph construction]]></title>
	<description><![CDATA[<p><span>AlfaPang constructs variation graphs, leveraging its alignment-free and reference-free approach, based solely on intrinsic sequence properties. This design allows AlfaPang's runtime and memory usage to scale linearly with the size of input sequences, enabling it to handle significantly larger genome sets compared to other methods.</span></p><p>Address of the bookmark: <a href="https://github.com/AdamCicherski/AlfaPang" rel="nofollow">https://github.com/AdamCicherski/AlfaPang</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44885/firecrawl-the-web-data-api-for-ai-turn-entire-websites-into-llm-ready-markdown-or-structured-data</guid>
	<pubDate>Thu, 28 Aug 2025 02:34:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44885/firecrawl-the-web-data-api-for-ai-turn-entire-websites-into-llm-ready-markdown-or-structured-data</link>
	<title><![CDATA[Firecrawl: The Web Data API for AI - Turn entire websites into LLM-ready markdown or structured data]]></title>
	<description><![CDATA[<p dir="auto"><a href="https://firecrawl.dev/?ref=github">Firecrawl</a>&nbsp;is an API service that takes a URL, crawls it, and converts it into clean markdown or structured data. We crawl all accessible subpages and give you clean data for each. No sitemap required. Check out our&nbsp;<a href="https://docs.firecrawl.dev/">documentation</a>.</p>
<p dir="auto"><em>Pst. hey, you, join our stargazers :)</em></p>
<p><em>&nbsp;</em></p>
<p><a href="https://github.com/firecrawl/firecrawl"></a></p><p>Address of the bookmark: <a href="https://github.com/firecrawl/firecrawl" rel="nofollow">https://github.com/firecrawl/firecrawl</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44882/fantasia</guid>
	<pubDate>Wed, 20 Aug 2025 02:48:15 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44882/fantasia</link>
	<title><![CDATA[FANTASIA]]></title>
	<description><![CDATA[<p dir="auto">FANTASIA is an advanced pipeline for the automatic functional annotation of protein sequences using state-of-the-art protein language models. It integrates deep learning embeddings and in-memory similarity searches, retrieving reference vectors from a PostgreSQL database with pgvector, to associate Gene Ontology (GO) terms with proteins.</p>
<p>https://www.nature.com/articles/s42003-025-08651-2</p><p>Address of the bookmark: <a href="https://github.com/CBBIO/FANTASIA" rel="nofollow">https://github.com/CBBIO/FANTASIA</a></p>]]></description>
	<dc:creator>BioStar</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44878/jaeger-an-accurate-and-fast-deep-learning-tool-to-detect-bacteriophage-sequences</guid>
	<pubDate>Thu, 14 Aug 2025 04:02:05 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44878/jaeger-an-accurate-and-fast-deep-learning-tool-to-detect-bacteriophage-sequences</link>
	<title><![CDATA[Jaeger : an accurate and fast deep-learning tool to detect bacteriophage sequences]]></title>
	<description><![CDATA[<p dir="auto">Jaeger is a tool that utilizes homology-free machine learning to identify phage genome sequences that are hidden within metagenomes. It is capable of detecting both phages and prophages within metagenomic assemblies.</p>
<p dir="auto">The performance of the Jaeger workflow can be significantly increased by utilizing GPUs. To enable GPU support, the CUDA Toolkit and cuDNN library must be accessible to conda.</p>
<div>
<pre><code># setup bioconda
conda config --add channels defaults
conda config --add channels bioconda
conda config --add channels conda-forge
conda config --set channel_priority strict

# create conda environment and install jaeger
mamba create -n jaeger -c nvidia -c conda-forge cuda-nvcc "python&gt;=3.9,&lt;3.12" pip jaeger-bio


# activate environment
conda activate jaeger</code></pre>
</div><p>Address of the bookmark: <a href="https://github.com/MGXlab/Jaeger" rel="nofollow">https://github.com/MGXlab/Jaeger</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44876/dna2bit-an-ultra-fast-and-accurate-genomic-distance-estimation-software</guid>
	<pubDate>Wed, 13 Aug 2025 19:56:21 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44876/dna2bit-an-ultra-fast-and-accurate-genomic-distance-estimation-software</link>
	<title><![CDATA[dna2bit: an ultra-fast and accurate genomic distance estimation software]]></title>
	<description><![CDATA[<p dir="auto">dna2bit: an ultra-fast and accurate genomic distance estimation software</p>
<div dir="auto"><a href="https://github.com/lijuzeng/dna2bit#compilation"></a></div>
<p dir="auto">dna2bit is a software tool developed in C++11, leveraging the capabilities of OpenMP for parallel computing and the popcount technique for efficient bit manipulation.&nbsp;</p><p>Address of the bookmark: <a href="https://github.com/lijuzeng/dna2bit" rel="nofollow">https://github.com/lijuzeng/dna2bit</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</guid>
	<pubDate>Wed, 13 Aug 2025 02:31:28 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44873/bakrep-denglish-blend-of-bakterien-repository-simplifies-access-to-this-data</link>
	<title><![CDATA[BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data]]></title>
	<description><![CDATA[<p>2,438,386 bacterial genomes at your fingertips consistently processed &amp; characterized, enriched with metadata, accessible via a flexible search engine.</p>
<p>BakRep (Denglish blend of Bakterien &amp; Repository) simplifies access to this data. It integrates enriched genomic information with metadata accessible via a flexible search-engine.</p>
<h1>Key features</h1>
<ul>
<li>Assembly statistics: ensure data quality with genome-based key metrics</li>
<li>Taxonomic classification: robust, purely genome-based classifications (<a href="https://gtdb.ecogenomic.org/" target="_blank">GTDB</a>)</li>
<li><a href="https://pubmlst.org/">MLST</a>: subtyping for deeper insights into genetic variation</li>
<li>Annotation: comprehensive &amp; taxonomy-independent (<a href="https://bakta.computational.bio/" target="_blank">Bakta</a>)</li>
<li>Metadata: full original submission records</li>
</ul>
<div>&nbsp;</div><p>Address of the bookmark: <a href="https://bakrep.computational.bio/" rel="nofollow">https://bakrep.computational.bio/</a></p>]]></description>
	<dc:creator>Neel</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44768/tritex-a-computational-pipeline-for-chromosome-scale-assembly-of-plant-genomes</guid>
	<pubDate>Fri, 14 Feb 2025 10:53:48 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44768/tritex-a-computational-pipeline-for-chromosome-scale-assembly-of-plant-genomes</link>
	<title><![CDATA[TRITEX, a computational pipeline for chromosome-scale assembly of plant genomes]]></title>
	<description><![CDATA[<p><span>This is the documentation of TRITEX, a computational pipeline for chromosome-scale assembly of plant genomes. It was developed in the research group Domestication Genomics at the Leibniz Institute of Plant Genetics and Crop Research (IPK) Gatersleben.</span></p><p>Address of the bookmark: <a href="https://tritexassembly.bitbucket.io/" rel="nofollow">https://tritexassembly.bitbucket.io/</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44742/nasa-open-science-data-repository</guid>
	<pubDate>Wed, 18 Dec 2024 11:54:47 -0600</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44742/nasa-open-science-data-repository</link>
	<title><![CDATA[NASA Open Science Data Repository]]></title>
	<description><![CDATA[<p><span>The NASA Open Science Data Repository (OSDR) enables access to space-related data from experiments and missions that investigate biological and health responses of terrestrial life to spaceflight. The goal of OSDR is to enable multi-modal and multi-hierarchical fundamental space life science data be reused toward basic science, applied science, and operational outcomes for space exploration and knowledge discovery. These data include &lsquo;omics, phenotypic, physiological, behavioral, hardware, environmental telemetry; raw, processed; tabular, text, code, bioimaging, and video.</span></p>
<p><span>https://www.nasa.gov/reference/osdr-data-processing/</span></p><p>Address of the bookmark: <a href="https://www.nasa.gov/osdr/" rel="nofollow">https://www.nasa.gov/osdr/</a></p>]]></description>
	<dc:creator>Abhi</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44675/variant-calling-pipeline</guid>
	<pubDate>Sat, 19 Oct 2024 12:23:40 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44675/variant-calling-pipeline</link>
	<title><![CDATA[Variant Calling Pipeline]]></title>
	<description><![CDATA[<p dir="auto">The&nbsp;<a href="https://github.com/Tom-Jenkins/maerl-wgs-pipelines/blob/main/src/variantcalling.nf"><code>variantcalling.nf</code></a>&nbsp;nextflow script will take any number of samples with paired-end reads in FASTQ format, map reads using Bowtie2, process BAM files, and finally call variants using BCFtools v1.21 and/or Freebayes v1.3.6. If part of the pipeline is unsuccessful for a sample then these errors are ignored.</p>
<p dir="auto">Pipeline flowchart:</p>
<div dir="auto">
<div dir="auto">
<div>&nbsp;</div>
<div></div>
</div>
<div>&nbsp;</div>
<div dir="auto">
<h2 dir="auto">Dependencies (version tested)</h2>
<a href="https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md#dependencies-version-tested"></a></div>
<ul dir="auto">
<li>Nextflow (24.04.4)</li>
<li>Java (18.0.2.1)</li>
<li>Python (3.10)</li>
<li>Perl (5.32.1)</li>
<li>Bowtie2 (2.5.3)</li>
<li>SAMtools (1.19.2)</li>
<li>GATK4 (4.5)</li>
<li>BCFtools (1.21)</li>
<li>Freebayes (1.3.6)</li>
</ul>
</div><p>Address of the bookmark: <a href="https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md" rel="nofollow">https://github.com/Tom-Jenkins/nextflow-pipelines/blob/main/docs/variant-calling.md</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>
<item>
	<guid isPermaLink="true">https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</guid>
	<pubDate>Tue, 17 Sep 2024 02:34:57 -0500</pubDate>
	<link>https://bioinformaticsonline.com/bookmarks/view/44663/svbyeye-r-package-to-visualize-alignments-between-two-or-multiple-dna-sequences</link>
	<title><![CDATA[SVbyEye: R Package to visualize alignments between two or multiple DNA sequences]]></title>
	<description><![CDATA[<p dir="auto">R Package to visualize alignments between two or multiple DNA sequences including<br>a number of functionalities to facilitate processing of alignments in PAF format.</p>
<p dir="auto"><span>SVbyEye, an open-source R package to visualize and annotate sequence-to-sequence alignments along with various functionalities to process alignments in PAF format. The tool facilitates the characterization of complex SVs in the context of sequence homology helping resolve the mechanisms underlying their formation. Availability and implementation SVbyEye is available at https://github.com/daewoooo/SVbyEye.</span></p>
<p dir="auto">Author: David Porubsky</p><p>Address of the bookmark: <a href="https://github.com/daewoooo/SVbyEye" rel="nofollow">https://github.com/daewoooo/SVbyEye</a></p>]]></description>
	<dc:creator>LEGE</dc:creator>
</item>

</channel>
</rss>