arrow
Volume 14, Issue 4
Similarity/ dissimilarity analysis of flowering plant DNA sequences

Xiaoshun Xu and Zhongrui Gao

J. Info. Comput. Sci. , 14 (2019), pp. 300-306.

Export citation
  • Abstract
1 Department of Mathematics, Jinan University, Guangzhou, 510632, China (Received November 06 2019, accepted December 28 2019) The multiple sequence alignment (MSA) is a usual tool in DNA sequence comparison. However, this method meets a hard challenge for a large number of long DNA sequences. To remedy this problem, we propose a new way for DNA sequence comparison based on a novel DNA map. The method is that, by assigning a dinucleotide to a number, we construct a new graphical representation of DNA sequences based on horizontal lines. We further utilize the maximal eigenvalue of a related matrix to derive a mathematical descriptor for a DNA sequence. We also perform the similarity/dissimilarity analysis among the coding sequences of ribulose bisphosphate carboxylase small chain gene and large chain gene of flowering plants. The results indicate that this method can be reliable in the comparison of the flowering plant DNA sequences.
  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JICS-14-300, author = {Xiaoshun Xu and Zhongrui Gao}, title = {Similarity/ dissimilarity analysis of flowering plant DNA sequences}, journal = {Journal of Information and Computing Science}, year = {2024}, volume = {14}, number = {4}, pages = {300--306}, abstract = {1 Department of Mathematics, Jinan University, Guangzhou, 510632, China (Received November 06 2019, accepted December 28 2019) The multiple sequence alignment (MSA) is a usual tool in DNA sequence comparison. However, this method meets a hard challenge for a large number of long DNA sequences. To remedy this problem, we propose a new way for DNA sequence comparison based on a novel DNA map. The method is that, by assigning a dinucleotide to a number, we construct a new graphical representation of DNA sequences based on horizontal lines. We further utilize the maximal eigenvalue of a related matrix to derive a mathematical descriptor for a DNA sequence. We also perform the similarity/dissimilarity analysis among the coding sequences of ribulose bisphosphate carboxylase small chain gene and large chain gene of flowering plants. The results indicate that this method can be reliable in the comparison of the flowering plant DNA sequences. }, issn = {1746-7659}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jics/22406.html} }
TY - JOUR T1 - Similarity/ dissimilarity analysis of flowering plant DNA sequences AU - Xiaoshun Xu and Zhongrui Gao JO - Journal of Information and Computing Science VL - 4 SP - 300 EP - 306 PY - 2024 DA - 2024/01 SN - 14 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jics/22406.html KW - Graphical representation, Dinucleotide, DNA map, Similarity/dissimilarity analysis, Phylogenetic tree, Flowering plants. AB - 1 Department of Mathematics, Jinan University, Guangzhou, 510632, China (Received November 06 2019, accepted December 28 2019) The multiple sequence alignment (MSA) is a usual tool in DNA sequence comparison. However, this method meets a hard challenge for a large number of long DNA sequences. To remedy this problem, we propose a new way for DNA sequence comparison based on a novel DNA map. The method is that, by assigning a dinucleotide to a number, we construct a new graphical representation of DNA sequences based on horizontal lines. We further utilize the maximal eigenvalue of a related matrix to derive a mathematical descriptor for a DNA sequence. We also perform the similarity/dissimilarity analysis among the coding sequences of ribulose bisphosphate carboxylase small chain gene and large chain gene of flowering plants. The results indicate that this method can be reliable in the comparison of the flowering plant DNA sequences.
Xiaoshun Xu and Zhongrui Gao. (2024). Similarity/ dissimilarity analysis of flowering plant DNA sequences. Journal of Information and Computing Science. 14 (4). 300-306. doi:
Copy to clipboard
The citation has been copied to your clipboard