Jove
Visualize
Contact Us

Related Experiment Videos

Gapped permutation pattern discovery for gene order comparisons.

Laxmi Parida1

  • 1Computational Biology Center, IBM T.J.Watson Research Center,Yorktown Heights, NewYork 10598, USA. parida@us.ibm.com

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|March 27, 2007
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

Publisher Correction: Tumor transcriptional state predicts survival in immune-checkpoint-blockade-treated glioblastoma.

Nature cancer·2026
Same author

Quantum ensembling methods for healthcare and life science.

Briefings in bioinformatics·2026
Same author

Tumor transcriptional state predicts survival in immune-checkpoint-blockade-treated glioblastoma.

Nature cancer·2026
Same author

Remics: a redescription-based framework for multi-omics analysis.

Frontiers in cell and developmental biology·2026
Same author

Genomic modifiers of malignant and neurodevelopmental phenotypes in individuals with PTEN hamartoma tumor syndrome.

NPJ genomic medicine·2026
Same author

Publisher Correction: Advancing single-cell omics and cell-based therapeutics with quantum computing.

Nature reviews. Molecular cell biology·2026
Same journal

GMSA: A Graph Matching and Point Cloud Registration-Based Method for Spatial Transcriptomics Data Alignment.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Investigations on Multiple Protein Scaffold Filling.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Cell Type Prediction for Single-Cell RNA Sequencing Utilizing Unsupervised Domain Adaptation and Semi-Supervised Learning.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

PPIGAN: Prediction of Protein-Protein Interactions Using Generative Adversarial Networks.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Deep Structure-Enhanced Cell Clustering Model for Single-Cell RNA Sequencing Data.

Journal of computational biology : a journal of computational molecular cell biology·2026
Same journal

Asymmetric Drug-Drug Interaction Prediction Based on Generative Adversarial Networks and Knowledge Graph.

Journal of computational biology : a journal of computational molecular cell biology·2026
See all related articles
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

This study introduces a new model for comparative genomics, identifying gapped permutation patterns across multiple genomes. The efficient algorithm helps analyze large-scale genomic data by finding gene clusters in at least K species.

Area of Science:

  • Computational Biology
  • Genomics
  • Bioinformatics

Background:

  • The increasing volume of sequenced genomes necessitates advanced comparative genomics tools.
  • Analyzing gene order and proximity across species is crucial for understanding genome evolution.
  • Existing methods face challenges in efficiently handling large-scale genomic datasets.

Purpose of the Study:

  • To present a generalized model for discovering gapped permutation patterns in multiple genomes.
  • To develop an efficient algorithm for identifying these patterns with multiplicity.
  • To address the challenge of analyzing genomes in a comparative context.

Main Methods:

  • A generalized model incorporating gapped permutation patterns (with gap g).
  • Genome clustering using a quorum parameter (K>1).

Related Experiment Videos

  • Algorithm designed to discover patterns with possible multiplicity occurring in at least K genomes.

    • Main Results:

    • An efficient algorithm with a time complexity of (log mN(I) + Σ log Σ N(O)).
    • The algorithm identifies permutation patterns with specified gaps and multiplicity.
    • Demonstrates effective analysis of large-scale genomic data.

    Conclusions:

    • The proposed model and algorithm offer an efficient approach to comparative genomics.
    • Facilitates the discovery of conserved gene order patterns across multiple species.
    • Advances the field of large-scale genomic data analysis.