BOL: Related items

HiTE: a fast and accurate dynamic boundary adjustment approach for full-length Transposable Elements detection and annotation in Genome Assemblies

LEGE — Sat, 20 Sep 2025 09:34:04 -0500

HiTE 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.

panHiTE

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.

For detailed instructions, please refer to the panHiTE tutorial.

Address of the bookmark: https://github.com/CSU-KangHu/HiTE

A Subway Map for the Genome

LEGE — Fri, 04 Sep 2026 04:14:14 -0500

Maya was looking at a genome graph on her computer. There were nodes, branches, and paths going in every direction.

“It’s like a subway map,” she said, “but for DNA.”

That idea is exactly what Sequence Tube Map brings to life.

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.

This makes complex genome graphs much easier to explore.

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.

What once looked like a tangled network now looked like a journey.

Sequence Tube Map turns the complexity of graph genomes into a visual story—making it easier for scientists to see how DNA can take different routes.

Read more at https://github.com/vgteam/sequencetubemap

and

https://academic.oup.com/bioinformatics/article/35/24/5318/5542397

Demo at https://vgteam.github.io/sequenceTubeMap/

The Genes That Travel Together: A Genomic Detective Story

BioStar — Fri, 11 Sep 2026 13:00:36 -0500

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—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.

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—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.

More at https://academic.oup.com/nargab/article/7/4/lqaf182/8377910?

FLAS: fast and high throughput algorithm for PacBio long read self-correction.

Jit — Sat, 22 Jun 2019 12:16:39 -0500

FLAS, a wrapper algorithm of MECAT, to achieve high throughput long read self-correction while keeping MECAT's fast speed. FLAS finds additional alignments from MECAT prealigned long reads to improve the correction throughput, and removes misalignments for accuracy.

Address of the bookmark: https://github.com/baoe/flas

Understanding reads mapping and flags !

Jit — Thu, 25 Apr 2019 09:06:20 -0500

Linear Alignment: An alignment of a read to a single reference sequence that may include insertions, deletions, skips and clipping, but may not include direction changes (i.e. one portion of the alignment on forward strand and another portion of alignment on reverse strand).

Chimeric Alignment: An alignment of a read that cannot be represented as a linear alignment. Typically, one of the linear alignments in a chimeric alignment is considered the “representative” alignment, and the others are called “supplementary” and are distinguished by the supplementary alignment flag.

Chimeric reads are indicative of structural variation in DNA-seq and it may indicate the presence of chimeric genes in RNA-seq.

In short, chimeric reads can be split in to two or more parts, each part would be mapped to reference(it’s not hard-clipped), the total length of the mapped part is longger than read length.

Representative alignment: A chimeric alignment that is represented as a set of linear alignments that do not have large overlaps typically has one linear alignment that is considered the representative alignment.

One read can align to multiple positions, we can find one alignmnet position which sequence do not have large overlaps, it called representative alighment, for other alignment positions, we called them supplementary alignment.

It seems that GATK can realignment those representative reads to the correctly position via RealignerTargetCreator and IndelRealigner. (WARNING: I am not quite sure if I understand this correctly. If someone could help me, please leave me a message below, thanks, thanks.)

Supplementary Alignment: A chimeric reads but not a representative reads.

Primary Alignment and Secondary Alignment: A read may map ambiguously to multiple locations, e.g. due to repeats. Only one of the multiple read alignments is considered primary, and this decision may be arbitrary. All other alignments have the secondary alignment flag.

Many-to-many pairwise alignments of two sequence sets

Poonam Mahapatra — Tue, 19 Jun 2018 08:34:15 -0500

needleall reads a set of input sequences and compares them all to one or more sequences, writing their optimal global sequence alignments to file. It uses the Needleman-Wunsch alignment algorithm to find the optimum alignment (including gaps) of two sequences along their entire length. The algorithm uses a dynamic programming method to ensure the alignment is optimum, by exploring all possible alignments and choosing the best. A scoring matrix is read that contains values for every possible residue or nucleotide match. Needleall finds the alignment with the maximum possible score where the score of an alignment is equal to the sum of the matches taken from the scoring matrix, minus penalties arising from opening and extending gaps in the aligned sequences. The substitution matrix and gap opening and extension penalties are user-specified.

Address of the bookmark: http://emboss.sourceforge.net/apps/release/6.6/emboss/apps/needleall.html

BamView: a free interactive display of read alignments in BAM data files

Neel — Fri, 09 Nov 2018 13:43:22 -0600

To run the application on UNIX from the downloaded jar file run the UNIX:

java -mx512m -jar BamView.jar

and extra command line options are given when '-h' is used:

java -jar BamView.jar -h

BAM files can be specified on the command line with the '-a' option:

java -mx512m -jar BamView.jar -a pathToFile/sorted.bam

If a BAM filename is not given on the command line BamView will prompt for a file to be entered. The BAM index file should have the same name as the BAM file but with a '.bai' suffix. Multiple BAM files can be loaded and overlaid in the viewer. To make this easier BamView will read in files that contain a list of filenames.

Address of the bookmark: http://bamview.sourceforge.net/

SVbyEye: R Package to visualize alignments between two or multiple DNA sequences

LEGE — Tue, 17 Sep 2024 02:34:57 -0500

R Package to visualize alignments between two or multiple DNA sequences including
a number of functionalities to facilitate processing of alignments in PAF format.

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.

Author: David Porubsky

Address of the bookmark: https://github.com/daewoooo/SVbyEye

Public Databases for Bioinformatics !

Jit — Tue, 23 Mar 2021 05:32:15 -0500

https://www.nature.com/articles/s41467-020-17155-y

Server Infrastructure:

File Server:

dhara: Synology 3614 Storage Appliance
4 Core Xeon
108TB disk storage
10Gb ethernet to SCG3
Access atx: dhara:5000
Has btsync server (try it - its much better than dropbox)

Compute Servers:

nandi: Kundaje and Phi Server
24 intel cores
256GB RAM
500GB of SSD storage 
36TB RAID6 local storage
4 Intel Phi's (space for 4 more GPU's)


durga: Montgomery and sensitive data
24 intel cores
256GB RAM
500GB of SSD RAID0 storage 
60TB RAID6 local storage

mitra: Bassik and Web/DB Server
24 core
256GB RAM 
500GB of SSD RAID0 storage 
36TB RAID6 local storage

vayu: Kundaje GPU server
4 core
64GB RAM 
200GB of SSD storage 
8TB RAID10 local storage
4 Nvidia GTX 970 4GB GPUs

amold: Bickel and SGE server
32 AMD core
128GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

wotan: Bickel and SGE server
64 AMD core
256GB RAM 
200GB of SSD storage 
12TB RAID5 local storage

Filesystem:

/users/$USER
default home directory
full backups nightly 
nfs mount to dhara
should store code, papers, and other highly processed data here

/mnt/data/
globally accessible data
should store common data here
e.g. genomes and indexes, annotations, ENCODE data  
if you dont want this to count towards your quote you must chown

/mnt/lab_data/$LAB/
lab accessible data
should store lab project data here 
e.g. ATAC-seq prediction data, enhancer prediction, motif calls

/srv/scratch/$USER
fast local storage
not backed up, but on raid and data will never be deleted
most analysis should be performed here

/srv/persistent/$USER
fast local storage
synced nightly, but not backed up
       ie if the hard drives fail or you delete something and notice 
       within 24 hours we can recover. Otherwise not. (vs home which is 
       properly backed up )  
intermediate analysis products that would be hard to recover should be stored here 
       e.g. stochastic analysis results that need to be kept so that paper 
       results can be reproduced

/srv/www/$LABNAME/
web accessible from mitra.stanford.edu
*NOT BACKED UP*

Some parallel programming patterns:

# gzip a bunch of files
parallel gzip -- *.FILESTOGZIP

# fork example in python:
(for more detailed examples look at 
 https://github.com/nboley/grit/ grit/lib/multiprocessing_utils.py)

import os
import time
import random

import multiprocessing

class ProcessSafeOPStream( object ):
    def __init__( self, writeable_obj ):
        self.writeable_obj = writeable_obj
        self.lock = multiprocessing.Lock()
        self.name = self.writeable_obj.name
        return
    
    def write( self, data ):
        self.lock.acquire()
        self.writeable_obj.write( data )
        self.writeable_obj.flush()
        self.lock.release()
        return
    
    def close( self ):
        self.writeable_obj.close()

def worker(queue, ofp):
    # Try without this
    random.seed()
    while True:
        i = queue.get()
        if i == 'FINISHED': return
        # simulate an expensive function
        x = random.random()
        time.sleep(x/10)
        print i, x
        ofp.write("%i\t%s\n" % (i, x))

NSIMS = 10000
NPROC = 25

# populate queue
todo = multiprocessing.Queue()
for i in xrange(NSIMS): todo.put(i)
for i in xrange(NPROC): todo.put('FINISHED')

ofp = ProcessSafeOPStream( open("output.txt", "w") )

pids = []
for i in xrange(NPROC):
    pid = os.fork()
    if pid == 0:
       worker(todo, ofp)
       os._exit(0)
    else:
       pids.append(pid)  

for pid in pids:
    os.waitpid(pid, 0)

ofp.close()

print "FINISHED"

For use case 1 we obtained the following ENCODE and ROADMAP datasets https://www.encodeproject.org/files/ENCFF446WOD/@@download/ENCFF446WOD.bed.gz, https://www.encodeproject.org/files/ENCFF546PJU/@@download/ENCFF546PJU.bam, https://www.encodeproject.org/files/ENCFF059BEU/@@download/ENCFF059BEU.bam. Blacklisted regions were obtained from http://mitra.stanford.edu/kundaje/akundaje/release/blacklists/hg38-human/hg38.blacklist.bed.gz. The human genome version hg38 was obtained from http://hgdownload.cse.ucsc.edu/goldenPath/hg38/bigZips/hg38.fa.gz.

For use case 2 we used the set of narrowPeak files summarized in https://github.com/wkopp/janggu_usecases/tree/master/extra/urls.txt (archived version v1.0.1). The human genome version hg19 was obtained from http://hgdownload.cse.ucsc.edu/goldenPath/hg19/bigZips/hg19.fa.gz

For use case 3 we used the ENCODE datasets https://www.encodeproject.org/files/ENCFF591XCX/@@download/ENCFF591XCX.bam, https://www.encodeproject.org/files/ENCFF736LHE/@@download/ENCFF736LHE.bigWig, https://www.encodeproject.org/files/ENCFF177HHM/@@download/ENCFF177HHM.bam as we as the GENCODE annotation v29 from ftp://ftp.ebi.ac.uk/pub/databases/gencode/Gencode_human/release_29/gencode.v29.annotation.gtf.gz.