Efficient algorithms for molecular sequence analysis.

Abstract

Efficient (linear time) algorithms are described for identifying global molecular sequence features allowing for errors including repeats, matches between sequences, dyad symmetry pairings, and other sequence patterns. A multiple sequence alignment algorithm is also described. Specific applications are given to hepatitis B viruses and the J5-C (J, joining; C, constant) region of the immunoglobulin kappa gene.

Keywords

Sequence (biology)AlgorithmSequence analysisComputational biologyMultiple sequence alignmentSequence alignmentComputer scienceGeneticsPeptide sequenceBiologyGene

Affiliated Institutions

Stanford University US

Related Publications

Recent Evolutions of Multiple Sequence Alignment Algorithms

Cédric Notredame

An ever-increasing number of biological modeling methods depend on the assembly of an accurate multiple sequence alignment (MSA). These include phylogenetic trees, profiles, and...

2007 PLoS Computational Biology 219 citations

PANDIT: an evolution-centric database of protein and associated nucleotide domains with inferred trees

Simon Whelan

PANDIT is a database of homologous sequence alignments accompanied by estimates of their corresponding phylogenetic trees. It provides a valuable resource to those studying phyl...

2005 Nucleic Acids Research 70 citations

The order of sequence alignment can bias the selection of tree topology.

James A. Lake

Sequential pairwise alignment of multiple sequences is a widely used procedure (Kruskal 1983 ).It is useful and generally successful when sequences within a set differ by relati...

1991 Molecular Biology and Evolution 150 citations

The CLUSTAL_X windows interface: flexible strategies for multiple sequence alignment aided by quality analysis tools

Julie Thompson , Toby J. Gibson , Frédéric Plewniak +2 more

CLUSTAL X is a new windows interface for the widely-used progressive multiple sequence alignment program CLUSTAL W. The new system is easy to use, providing an integrated system...

1997 Nucleic Acids Research 38996 citations

Automated generation of heuristics for biological sequence comparison

Guy Slater , Ewan Birney

Abstract Background Exhaustive methods of sequence alignment are accurate but slow, whereas heuristic approaches run quickly, but their complexity makes them more difficult to i...

2005 BMC Bioinformatics 2984 citations

Publication Info

Year: 1988
Type: article
Volume: 85
Issue: 3
Pages: 841-845
Citations: 49
Access: Closed

External Links

View on DOI.org

Social Impact

Altmetric

Efficient algorithms for molecular sequence analysis.

PlumX Metrics

Social media, news, blog, policy document mentions

Citation Metrics

OpenAlex

Cite This

APA Style

                            
                                
                                    Samuel Karlin, 
                                
                                    Macdonald Morris, 
                                
                                    Ghassan Ghandour
                                
                                et al.
                            
                            (1988). 
                            Efficient algorithms for molecular sequence analysis.. 
                            Proceedings of the National Academy of Sciences
                            , 85
                            (3)
                            , 841-845.
                            https://doi.org/10.1073/pnas.85.3.841
                        

Identifiers

DOI: 10.1073/pnas.85.3.841