New approaches for computer analysis of nucleic acid sequences.

DOI10.1073/pnas.80.18.5660zbMath0517.92013OpenAlexW2041564485WikidataQ37349260 ScholiaQ37349260MaRDI QIDQ3666654

Samuel Karlin, Laurence J. Korn, Simon Tavaré, Friedemann Ost, Ghassan I. Ghandour

Publication date: 1983

Published in: Proceedings of the National Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1073/pnas.80.18.5660

zbMATH Keywords

homologyhuman papillomaviruslambda phagemitochondrial genomescomputer analysis of nucleic acid sequencesdyad symmetriesimmunoglobulin kappa-chain genesnew high-speed computer algorithmpapovaviruses

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Physiological, cellular and medical topics (92Cxx)

Related Items

Maximal success durations for a semi-Markov process, Suffix-sorting via Shannon-Fano-Elias codes, Estimating primate divergence times by using conditioned birth-and-death processes, \(p\)-suffix sorting as arithmetic coding, Property Suffix Array with Applications in Indexing Weighted Sequences, Fast, practical algorithms for computing all the repeats in a string, An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences, Efficient pattern matching for RNA secondary structures, A survey of multiple sequence comparison methods, The exploitation of assembly language instructions in biological text manipulation. I: Nucleotide sequences, Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons, Markov Additive Processes and Repeats in Sequences, A note on the longest matching consecutive subsequence, A Phase Transition for the Distribution of Matching Blocks, On longest matching consecutive subsequence, General methods of sequence comparison, An Erdős-Rényi law with shifts