BOL: Related items

MALVA: Genotyping by Mapping-free ALlele Detection of Known VAriants

Jit — Tue, 28 Jan 2020 03:39:22 -0600

MALVA is able to genotype multi-allelic SNPs and indels without mapping reads

MALVA calls correctly more indels than the most widely adopted genotyping pipelines

Mapping-free approaches are as accurate as alignment-based ones, while being faster

More at https://www.sciencedirect.com/science/article/pii/S2589004219302366

https://www.sciencedirect.com/science/article/pii/S2589004219302366

Address of the bookmark: https://github.com/AlgoLab/malva

Computational resources for TE discovery and TE detection

Abhimanyu Singh — Mon, 12 Feb 2018 10:29:18 -0600

Transposable Elements (TEs) to genome structure and evolution as well as their impact on genome sequencing, assembly, annotation and alignment has generated increasing interest in developing new methods for their computational analysis.

Following are the list of resource and location for TE discovery and TE detection:

BLASTER suite http://urgi.versailles.inra.fr/development/blaster/

Censor http://www.girinst.org/censor/download.php

find_ltr http://darwin.informatics.indiana.edu/cgi-bin/evolution/ltr.pl

FINDMITE http://jaketu.biochem.vt.edu/dl_software.htm

HMMER http://hmmer.janelia.org/

LTR_FINDER http://tlife.fudan.edu.cn/ltr_finder/

LTR_STRUC http://www.genetics.uga.edu/retrolab/data/LTR_Struc.html

LTR_MINER http://genomebiology.com/2004/5/10/R79/suppl/s7

LTR_par http://www.eecs.wsu.edu/~ananth/software.htm

MAK http://wesslercluster.plantbio.uga.edu/mak06.html

MaskerAid http://blast.wustl.edu/maskeraid/

mer-engine http://mer-engine.cshl.edu/mer-home.php

mreps http://bioinfo.lifl.fr/mreps/

PILER http://www.drive5.com/piler/

PLOTREP http://repeats.abc.hu/cgi-bin/plotrep.pl

RepBase http://www.girinst.org/

RepeatFinder http://cbcb.umd.edu/software/RepeatFinder/

RepeatGluer http://nbcr.sdsc.edu/euler/intro_tmp.htm

RepeatMasker http://www.repeatmasker.org/

RepeatRunner http://www.yandell-lab.org/repeat_runner/index.html

RepeatScout http://repeatscout.bioprojects.org/

repeat-match http://mummer.sourceforge.net/

REPuter http://www.genomes.de/

RetroMap http://www.burchsite.com/bioi/RetroMapHome.html

SMaRTFinder http://bioinf.dimi.uniud.it/software/software/smartfinder

Tandem Repeats Finder http://tandem.bu.edu/trf/trf.html

Transposon Cluster Finder http://www.mssm.edu/labs/warbup01/paper/files.html

TE nest http://www.plantgdb.org/prj/TE_nest/TE_nest.html

TRANSPO http://alggen.lsi.upc.es/recerca/search/transpo/transpo.html

TSDfinder http://www.ncbi.nlm.nih.gov/CBBresearch/Landsman/TSDfinder/

Tu Lab TE tools http://jaketu.biochem.vt.edu/dl_software.htm

WU-BLAST http://blast.wustl.edu

ReMILO: reference assisted misassembly detection algorithm using short and long reads.

Jit — Fri, 06 Jul 2018 04:27:49 -0500

ReMILO, a reference assisted misassembly detection algorithm that uses both short reads and PacBio SMRT long reads. ReMILO aligns the initial short reads to both the contigs and reference genome, and then constructs a novel data structure called red-black multipositional de Bruijn graph to detect misassemblies. In addition, ReMILO also aligns the contigs to long reads and find their differences from the long reads to detect more misassemblies.

Address of the bookmark: https://github.com/songc001/remilo

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

Webinar: Wednesday 21 August 2013 at Noon EDT

Jitendra Narayan — Sun, 11 Aug 2013 19:31:56 -0500

This webinar will describe the use of combinatorial pooling to reconstruct gene sequences within BACs. Recent work in barley has shown that this level of sequence knowledge is sufficient to support critical end-point objectives such as map-based cloning and marker-assisted breeding.

http://www.extension.org/pages/67926/upcoming-webinar:-selective-sequencing-through-combinatorial-pooling#.UggsVuHyPqU

Research Associate (RA) at INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY

Mon, 05 May 2014 08:44:24 -0500

INSTITUTE OF ADVANCED STUDY IN SCIENCE AND TECHNOLOGY
(An Autonomous Institute under Department of Science and Technology, Govt. of India)
Paschim Boragaon, Garchuk, Guwahati-781035

Appointment Adv.No.2

Applications in plain paper are invited from Indian citizens for one/two position each of Research Associate, Traineeship and Studentship for BIF facility, Division of Life Sciences, IASST.

Applications with complete Bio-data containing contact address, e-mail and phone number, two recent passport size photographs and attested copies of mark sheets, certificates etc., should be sent to the Registrar, IASST, Paschim Boragaon, Garchuk, Guwahati – 781035, Assam, so as to reach on or before 5/05/2014.

A. Research Associate:

Number of vacancies: 1 (One)

Qualifications:

PhD in Bioinformatics or allied disciplines with knowledge of Bioinformatics. The candidates who have submitted PhD thesis may also apply.

In case, candidates having PhD are not found, candidates having MSc in Bioinformatics or allied disciplines with sound knowledge of Bioinformatics will be preferred.

Remuneration: Candidate having PhD will get a consolidated remuneration of Rs. 22,000/- +HRA per month. MSc having NET/GATE/SLET qualified candidate will get a remuneration of Rs. 16,000/= and HRA and candidate with only MSc will get a remuneration of Rs.14,000/- and HRA.

Tenure:

The post is initially for one year and may be extended depending on the performance till the tenure of the project.

B. Traineeship:

Number of vacancies: 2 (Two)

Qualifications:

Candidate with a postgraduate degree in Bioinformatics/Biotechnology/Life sciences from a recognised University

Remuneration: Rs. 5000/month for 6 months

C. Studentship:

Number of vacancies: 2 (Two)

Qualifications:

Candidate pursuing M.Sc in bioinformatics in a recognised University.

Remuneration: Rs. 5000/month for 6 months

http://iasst.gov.in/pdf/recruitment/advt%20no_2_24042014.pdf

NCBI Gene Screencast

Fri, 30 May 2014 06:21:18 -0500

A short walkthrough of the NCBI Gene page

Genome Stability Laboratory

Mon, 07 Mar 2016 04:16:32 -0600

The bakers yeast, Saccharomyces cerevisiae is an ideal model organism to understand mechanisms of meiotic chromosome segregation. In S. cerevisiae and in mammals, the majority of meiotic crossovers are formed through a highly conserved MSH4p-MSH5p, MLH1p-MLH3p dependent pathway. We are interested in charactering the role of these complexes in crossover formation and distribution among all homolog pairs. Errors in this process are linked to congenital birth defects in humans such as Down's syndrome.Our laboratory is also interested in understanding the effect of genetic background on mutation rate variation using S. cerevisiae as a model. These studies are relevant for understanding cancer progression, genome evolution and architecture. We use high- throughput genomic methods as well as classical genetics to achieve these aims.

More at http://faculty.iisertvm.ac.in/~nishantkt/index.html

Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm)

Abhimanyu Singh — Thu, 29 Dec 2016 03:26:45 -0600

Prodigal (Prokaryotic Dynamic Programming Genefinding Algorithm) is a microbial (bacterial and archaeal) gene finding program developed at Oak Ridge National Laboratory and the University of Tennessee. Key features of Prodigal include:

Speed: Prodigal is an extremely fast gene recognition tool (written in very vanilla C). It can analyze an entire microbial genome in 30 seconds or less.
Accuracy: Prodigal is a highly accurate gene finder. It correctly locates the 3' end of every gene in the experimentally verified Ecogene data set (except those containing introns). It possesses a very sophisticated ribosomal binding site scoring system that enables it to locate the translation initiation site with great accuracy (96% of the 5' ends in the Ecogene data set are located correctly).
Specificity: Prodigal's false positive rate compares favorably with other gene identification programs, and usually falls under 5%.
GC-Content Indifferent: Prodigal performs well even in high GC genomes, with over a 90% perfect match (5'+3') to the Pseudomonas aeruginosa curated annotations.
Metagenomic Version: Prodigal can run in metagenomic mode and analyze sequences even when the organism is unknown.
Ease of Use: Prodigal can be run in one step on a single genomic sequence or on a draft genome containing many sequences. It does not need to be supplied with any knowledge of the organism, as it learns all the properties it needs to on its own.
Open Source: Prodigal source code is freely available under the General Public License.

Download the latest version of Prodigal at the Prodigal github page.
or
Browse the wiki documenation.

Address of the bookmark: http://prodigal.ornl.gov/

BioGPS: Spotlight on the Gene Expression Atlas

Jit — Thu, 18 Oct 2018 12:15:12 -0500

BioGPS opened 2016 with a publication in Nucleic Acids Research, right after the New Year holiday. Throughout the year, new designs for the site were being created, reviewed, adjusted, reviewed, adjusted, and more review/adjustments in anticipation of a site redesign for 2017. A Plugin registration Blitz was held in March and April; followed by a Plugin Review Blitz in May. The BioGPS spotlight series was also restarted, with spotlights on BGEE, Intermine, and other Intermine-related plugins.

There were ~910,000 requests made to BioGPS in 2016. Requests to BioGPS peaked in March and at the lowest in December.

Address of the bookmark: http://biogps.org/