Author: Karthi Balasubramanian; Nithin Nagaraj
Title: Automatic Identification of SARS Coronavirus using Compression-Complexity Measures Document date: 2020_3_27
ID: ljli6a2z_21
Snippet: Even though the idea of relative distance is an efficient one, GenCompress is a complicated algorithm that is computationally intensive. To overcome the above mentioned difficulties, Otu et al. [15] proposed similar but computationally simpler relative distance measures based on the Lempel-Ziv (LZ) [22] complexity measure. Given two sequences S and Q, sequences SQ and QS are formed by concatenation 4 . These four sequences are used to define four.....
Document: Even though the idea of relative distance is an efficient one, GenCompress is a complicated algorithm that is computationally intensive. To overcome the above mentioned difficulties, Otu et al. [15] proposed similar but computationally simpler relative distance measures based on the Lempel-Ziv (LZ) [22] complexity measure. Given two sequences S and Q, sequences SQ and QS are formed by concatenation 4 . These four sequences are used to define four distance measures using the LZ complexity measure, as given below:
Search related documents:
Co phrase search for related documents- complexity measure and LZ complexity measure: 1, 2, 3
- complexity measure and LZ complexity measure distance measure: 1
- complexity measure and relative distance: 1, 2
- complexity measure and relative distance measure: 1, 2
- distance measure and LZ complexity measure: 1
- distance measure and LZ complexity measure distance measure: 1
- distance measure and relative distance: 1, 2, 3, 4, 5, 6, 7
- distance measure and relative distance measure: 1, 2, 3, 4
- LZ complexity measure and relative distance: 1
- LZ complexity measure and relative distance measure: 1
- LZ complexity measure distance measure and relative distance: 1
- LZ complexity measure distance measure and relative distance measure: 1
Co phrase search for related documents, hyperlinks ordered by date