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

A linear time algorithm for finding all maximal scoring subsequences.

W L Ruzzo1, M Tompa

  • 1Department of Computer Science and Engineering, University of Washington, Seattle 98195-2350, USA. ruzzo@cs.washington.edu

Proceedings. International Conference on Intelligent Systems for Molecular Biology
|April 29, 2000
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

Motif discovery in heterogeneous sequence data.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2004
Same author

Improved gene selection for classification of microarrays.

Pacific Symposium on Biocomputing. Pacific Symposium on Biocomputing·2003
Same author

Model-based clustering and data transformations for gene expression data.

Bioinformatics (Oxford, England)·2001
Same author

Principal component analysis for clustering gene expression data.

Bioinformatics (Oxford, England)·2001
Same author

Identifying functional elements by comparative DNA sequence analysis.

Genome research·2001
Same author

Validating clustering for gene expression data.

Bioinformatics (Oxford, England)·2001
Same journal

Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology (ISMB 2000). San Diego, California, USA. August 19-23, 2000.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2001
Same journal

Analysis of gene expression data with pathway scores.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Towards a complete map of the protein space based on a unified sequence and structure analysis of all known proteins.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Mining for putative regulatory elements in the yeast genome using gene expression data.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

A multiple alignment algorithm for metabolic pathway analysis using enzyme hierarchy.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
Same journal

Sequence database search using jumping alignments.

Proceedings. International Conference on Intelligent Systems for Molecular Biology·2000
See all related articles

We developed a fast linear time algorithm to find the best nonoverlapping subsequences in data. This significantly improves upon previous quadratic time methods for biological sequence analysis.

Area of Science:

  • Computational biology
  • Bioinformatics algorithms
  • Sequence analysis

Background:

  • Identifying high-scoring subsequences is crucial for biological sequence analysis.
  • Previous algorithms for this task had a worst-case quadratic time complexity.
  • Applications include identifying protein domains and transmembrane regions.

Purpose of the Study:

  • To present a novel linear time algorithm for finding nonoverlapping, contiguous subsequences with the greatest total scores.
  • To improve the efficiency of analyzing biological sequences.

Main Methods:

  • Development of a practical linear time algorithm.
  • Algorithm focuses on identifying nonoverlapping, contiguous subsequences with maximal total scores.

Related Experiment Videos

Main Results:

  • The new algorithm achieves linear time complexity.
  • This is a significant improvement over the previously best-known quadratic time algorithm.
  • The algorithm is practical for real-world applications.

Conclusions:

  • The developed linear time algorithm provides a more efficient solution for identifying significant subsequences in biological data.
  • This advancement facilitates the analysis of nucleic acid and protein sequences.
  • Enables more effective identification of functional regions such as transmembrane domains and DNA binding sites.