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