A novel DNA sequence similarity calculation based on simplified pulse-coupled neural network and Huffman coding
From MaRDI portal
Publication:1619805
DOI10.1016/j.physa.2016.05.004zbMath1400.92398OpenAlexW2391072325MaRDI QIDQ1619805
Yanyan Chen, Xin Jin, Rencan Nie, Jiefu Yu, Quan Wang, Dong-Ming Zhou, Shao-Wen Yao
Publication date: 13 November 2018
Published in: Physica A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physa.2016.05.004
DNA sequenceEuclidean distanceHuffman codingsequence similaritysimplified pulse-coupled neural network
Cites Work
- Improving performance of network covert timing channel through Huffman coding
- Similarity analysis of DNA sequences based on the EMD method
- A quasi-MQ EMD method for similarity analysis of DNA sequences
- A new graphical coding of DNA sequence and its similarity calculation
- Similarity analysis for DNA sequences based on chaos game representation. Case study: the albumin
- A novel representation of DNA sequence based on CMI coding
- A 3D graphical representation of protein sequences based on the Gray code
- New 3D graphical representation of DNA sequence based on dual nucleotides
- Extraction of high quality \(k\)-words for alignment-free sequence comparison
- A measure of DNA sequence similarity by Fourier transform with applications on hierarchical clustering
- A representation of DNA primary sequences by random walk
- A new algorithm for finding the shortest paths using PCNNs
- Study of LZ-word distribution and its application for sequence comparison
- Linear regression model of short \(k\)-word: a similarity distance suitable for biological sequences with various lengths
- Huffman Coding with Letter Costs: A Linear-Time Approximation Scheme
- The non-power model of the genetic code: a paradigm for interpreting genomic information
- A Method for the Construction of Minimum-Redundancy Codes
