Algorithms for identifying local molecular sequence features
- 1 March 1988
- journal article
- research article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 4 (1) , 41-51
- https://doi.org/10.1093/bioinformatics/4.1.41
Abstract
Efficient algorithms are described for identifying local molecular sequence features including repeats, dyad symmetry pairings and aligned matches between sequences, while allowing for errors. Specific applications are given to the genomic sequences of the Epstein-Barr virus, Varicella-Zoster virus and the bacteriophages λ and T7.This publication has 10 references indexed in Scilit:
- Efficient algorithms for molecular sequence analysis.Proceedings of the National Academy of Sciences, 1988
- Genetic Relations between Varicella-Zoster Virus and Epstein-Barr VirusJournal of General Virology, 1987
- The Complete DNA Sequence of Varicella-Zoster VirusJournal of General Virology, 1986
- Significant potential secondary structures in the Epstein-Barr virus genome.Proceedings of the National Academy of Sciences, 1986
- Multiple-alphabet amino acid sequence comparisons of the immunoglobulin kappa-chain constant domain.Proceedings of the National Academy of Sciences, 1985
- Comparative statistics for DNA and protein sequences: single sequence analysis.Proceedings of the National Academy of Sciences, 1985
- Propagation of some human DNA sequences in bacteriophage lambda vectors requires mutant Escherichia coli hosts.Proceedings of the National Academy of Sciences, 1985
- DNA sequence and expression of the B95-8 Epstein—Barr virus genomeNature, 1984
- Nucleotide sequence of bacteriophage λ DNAJournal of Molecular Biology, 1982
- Cloning yeast telomeres on linear plasmid vectorsCell, 1982