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

Improvement of the A(*) Algorithm for Multiple Sequence Alignment.

Kobayashi, Imai

    Genome Informatics. Workshop on Genome Informatics
    |November 10, 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

    Regiochemistry in aryl radical cyclization onto methylenecycloalkanes

    The Journal of organic chemistry·2001
    Same author

    Efficacy of IFN therapy based on duration period of negative HCV-RNA during IFN administration.

    Hepatology research : the official journal of the Japan Society of Hepatology·2001
    Same author

    The author replies

    Surgical endoscopy·2000
    Same author

    Fluctuations of lamellar structure prior to a lamellar-->gyroid transition in a nonionic surfactant system

    Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics·2000
    Same author

    Measurement of direct photon emission in K+-->pi(+)pi(0)gamma decay

    Physical review letters·2000
    Same author

    The Level of Lipoprotein(a) in Human Cataractous Lens.

    Japanese journal of ophthalmology·2000

    New algorithms improve DNA and protein sequence alignment by using advanced estimators and bounding techniques for the shortest path problem. These methods enhance efficiency with more sequences or lower similarity.

    Area of Science:

    • Bioinformatics
    • Computational Biology
    • Molecular Biology

    Background:

    • Sequence alignment is crucial in molecular biology.
    • The alignment problem can be modeled as a shortest path problem.
    • Previous work utilized 2-dimensional sub-alignments with the A(*) algorithm.

    Purpose of the Study:

    • To develop more powerful estimators for sequence alignment.
    • To introduce a novel bounding technique for shortest path algorithms.
    • To enhance the efficiency of sequence alignment algorithms.

    Main Methods:

    • Utilizing k-dimensional (k>=3) sub-alignments for improved estimation.
    • Introducing a new bounding technique using V(Delta) for path optimization.
    • Developing a recursive-estimate version of the alignment algorithm.

    Related Experiment Videos

    Main Results:

    • New estimators significantly enhance the alignment process.
    • The V(Delta) bounding technique improves shortest path calculations.
    • The recursive-estimate version offers further algorithmic improvements.

    Conclusions:

    • The proposed algorithms offer powerful and efficient solutions for DNA and protein sequence alignment.
    • These methods are particularly beneficial for large datasets and low sequence similarity.
    • The study advances computational approaches in molecular biology.