Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Efficient decoding algorithms for generalized hidden Markov model gene finders.

William H Majoros1, Mihaela Pertea, Arthur L Delcher

  • 1Bioinformatics Department, The Institute for Genomic Research, 9712 Medical Center Drive, Rockville, MD, USA. bmajoros@tigr.org

BMC Bioinformatics
|January 26, 2005
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Testing the reliability of AI-generated protein structures.

bioRxiv : the preprint server for biology·2026
Same author

Integrating Negative-Pressure Wound Therapy in the Therapeutic Protocol of Extensive Pediatric Burns: Current Practice and Further Treatment Decision Algorithm.

Medicina (Kaunas, Lithuania)·2026
Same author

Mesenchymal Stem Cell-Derived Extracellular Vesicles and Plant-Derived Nanovesicles as Cell-Free Therapies for Thermal Burn Healing: A Systematic Review of Preclinical Evidence and Delivery Strategies.

Medical sciences (Basel, Switzerland)·2026
Same author

StringTie3 improves total RNA-seq assembly by resolving nascent and mature transcripts.

Nature methods·2026
Same author

Comparison of unbiased metagenomic next generation sequencing to targeted multiplex diagnostic assays for the detection of respiratory viruses.

PloS one·2026
Same author

Amino Acids-Potential Biomarkers of Histological Features for MASLD in Pediatric Obesity.

International journal of molecular sciences·2026
Same journal

OpenIMC: an open-source platform for analyzing single-cell and spatial proteomics by imaging mass cytometry.

BMC bioinformatics·2026
Same journal

NAP: an open source pipeline for cross-domain microbiome profiling using Nanopore sequencing-derived amplicon data.

BMC bioinformatics·2026
Same journal

SurvGME: an R package for survival analysis with graphical and measurement error models.

BMC bioinformatics·2026
Same journal

SimMapNet: a Bayesian framework for gene regulatory network inference using gene ontology similarities as external hint.

BMC bioinformatics·2026
Same journal

Dual channel drug-drug interactions extraction based on cross attention.

BMC bioinformatics·2026
Same journal

FeSseqdb: a curated sequence-level database and interpretable machine learning framework for identifying iron-sulfur proteins.

BMC bioinformatics·2026
See all related articles

Optimized Generalized Hidden Markov Model (GHMM) algorithms enhance computational gene prediction efficiency. New software architectures and sensor optimizations significantly reduce memory usage and maintain speed for homology-based gene finding.

Area of Science:

  • Computational biology
  • Bioinformatics
  • Genomics

Background:

  • Generalized Hidden Markov Models (GHMMs) are effective for eukaryotic gene prediction.
  • Integrating homology information into GHMMs improves accuracy but increases computational cost.
  • Efficient implementation of complex GHMM algorithms is crucial for next-generation gene finders.

Purpose of the Study:

  • To address implementation challenges in GHMM-based gene prediction.
  • To develop memory-efficient and fast GHMM algorithms.
  • To facilitate the exploration of advanced GHMM extensions for gene finding.

Main Methods:

  • Described two software architectures for GHMM-based gene finders: array-based and a memory-optimized approach.
  • Optimized content sensors for both architectures, achieving a twofold acceleration.

Related Experiment Videos

  • Demonstrated the impact of optimizations on a homology-based gene finder (TWAIN).

    • Main Results:

    • A highly optimized GHMM algorithm requires significantly less memory with comparable speed to array-based methods.
    • Optimized content sensors doubled the performance of GHMM architectures.
    • Optimizations proved feasible for advanced homology-based gene prediction systems like TWAIN.

    Conclusions:

    • Presented optimizations for GHMM-based gene finders.
    • Released two open-source software systems embodying these optimizations.
    • Aimed to enable further research into GHMM extensions for improved gene prediction.