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

Indexing huge genome sequences for solving various problems.

K Sadakane1, T Shibuya

  • 1Graduate School of Information Sciences, Tohoku University, Aoba-yama 09, Sendai 980-8579, Japan. sada@dais.is.tohoku.ac.jp

Genome Informatics. International Conference on Genome Informatics
|January 16, 2002
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

Blazar spectral variability as explained by a twisted inhomogeneous jet.

Nature·2017
Same author

Effect of interlamellar interactions on shear induced multilamellar vesicle formation.

The Journal of chemical physics·2017
Same author

An efficient alignment algorithm for searching simple pseudoknots over long genomic sequence.

IEEE/ACM transactions on computational biology and bioinformatics·2012
Same author

Size effects of polystyrene nanoparticles on atopic dermatitislike skin lesions in NC/NGA mice.

International journal of immunopathology and pharmacology·2010
Same author

A massive binary black-hole system in OJ 287 and a test of general relativity.

Nature·2008
Same author

The effects of microbial materials adhered to Asian sand dust on allergic lung inflammation.

Archives of environmental contamination and toxicology·2008
Same journal

Linear regression models predicting strength of transcriptional activity of promoters.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Sign: large-scale gene network estimation environment for high performance computing.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Docking-calculation-based method for predicting protein-RNA interactions.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Mechanism of cell cycle disruption by multiple p53 pulses.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

Database for crude drugs and Kampo medicine.

Genome informatics. International Conference on Genome Informatics·2012
Same journal

A dynamic programming algorithm to predict synthesis processes of tree-structured compounds with graph grammar.

Genome informatics. International Conference on Genome Informatics·2011
See all related articles

Researchers developed a compressed suffix array for efficient genome sequence searching. This in-memory index speeds up complex queries on large genomic datasets, making bioinformatics analysis faster.

Area of Science:

  • Bioinformatics
  • Computational Biology
  • Genomics

Background:

  • Genome sequence databases are rapidly growing, increasing the need for efficient indexing methods.
  • Traditional indexing methods like suffix trees and suffix arrays are unsuitable for complex queries on large datasets due to slow disk-based storage.

Purpose of the Study:

  • To propose an in-memory, compressed suffix array for faster and more efficient querying of large genome sequence databases.
  • To develop an approximate string matching algorithm optimized for the compressed suffix array.

Main Methods:

  • Implementation and experimental evaluation of a compressed suffix array.
  • Construction of the compressed suffix array for the entire human genome.
  • Development of an approximate string matching algorithm tailored for the compressed suffix array.

Related Experiment Videos

Main Results:

  • The compressed suffix array offers reasonable practical overhead despite theoretical access speed slowdowns.
  • The compressed suffix array for the human genome (approx. 2GB) can be handled in main memory on a standard workstation.
  • This approach significantly accelerates solutions for various genome informatics problems.

Conclusions:

  • In-memory compressed suffix arrays are a viable and efficient solution for indexing and querying large genomic datasets.
  • This method enhances the speed and feasibility of complex bioinformatics analyses, including approximate string matching.