Pages that link to "Item:Q3666654"
From MaRDI portal
The following pages link to New approaches for computer analysis of nucleic acid sequences. (Q3666654):
Displaying 17 items.
- Efficient pattern matching for RNA secondary structures (Q500967) (← links)
- Estimating primate divergence times by using conditioned birth-and-death processes (Q615611) (← links)
- Fast, practical algorithms for computing all the repeats in a string (Q626893) (← links)
- The exploitation of assembly language instructions in biological text manipulation. I: Nucleotide sequences (Q678500) (← links)
- General methods of sequence comparison (Q799527) (← links)
- An accurate approximation to the distribution of the length of the longest matching word between two random DNA sequences (Q920873) (← links)
- An Erdős-Rényi law with shifts (Q1071378) (← links)
- Maximal success durations for a semi-Markov process (Q1094005) (← links)
- A survey of multiple sequence comparison methods (Q1191624) (← links)
- Poisson, compound Poisson and process approximations for testing statistical significance in sequence comparisons (Q1194425) (← links)
- Suffix-sorting via Shannon-Fano-Elias codes (Q1662548) (← links)
- \(p\)-suffix sorting as arithmetic coding (Q1932361) (← links)
- A note on the longest matching consecutive subsequence (Q2297524) (← links)
- A Phase Transition for the Distribution of Matching Blocks (Q4715263) (← links)
- On longest matching consecutive subsequence (Q5232179) (← links)
- Markov Additive Processes and Repeats in Sequences (Q5443748) (← links)
- Property Suffix Array with Applications in Indexing Weighted Sequences (Q6039923) (← links)