Literature DB >> 2838137

Algorithms for identifying local molecular sequence features.

S Karlin1, M Morris, G Ghandour, M Y Leung.   

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 lambda and T7.

Entities:  

Mesh：

Substances：

Year:  1988        PMID： 2838137     DOI： 10.1093/bioinformatics/4.1.41

Source DB:  PubMed          Journal:  Comput Appl Biosci        ISSN： 0266-7061


  4 in total

1.  An efficient algorithm for identifying matches with errors in multiple long molecular sequences.

Authors:  M Y Leung; B E Blaisdell; C Burge; S Karlin
Journal:  J Mol Biol       Date:  1991-10-20       Impact factor: 5.469

2.  Average values of a dissimilarity measure not requiring sequence alignment are twice the averages of conventional mismatch counts requiring sequence alignment for a computer-generated model system.

Authors:  B E Blaisdell
Journal:  J Mol Evol       Date:  1989-12       Impact factor: 2.395

3.  Effectiveness of measures requiring and not requiring prior sequence alignment for estimating the dissimilarity of natural sequences.

Authors:  B E Blaisdell
Journal:  J Mol Evol       Date:  1989-12       Impact factor: 2.395

4.  Statistical analyses of counts and distributions of restriction sites in DNA sequences.

Authors:  S Karlin; C Burge; A M Campbell
Journal:  Nucleic Acids Res       Date:  1992-03-25       Impact factor: 16.971
  4 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.