Search PubMedSearch

Biomedical subjects

M Y Leung

Publications and source records attributed to M Y Leung.

3 recordsLinked to original sources

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

An efficient algorithm is described for finding matches, repeats and other word relations, allowing for errors, in large data sets of long molecular sequences. The algorithm entails hashing on fixed-size words in conjunction with the use of a linked list connecting all occurrences of the same word. The average memory and run time requirement both increase almost linearly with the total sequence length. Some results of the program's performance on a database of Escherichia coli DNA sequences are presented.

Algorithms

Efficient algorithms for molecular sequence analysis.

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.

Algorithms

Algorithms for identifying local molecular sequence features.

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.

Algorithms