Fast Algorithm for the Minimum Chebyshev Distance in RNA Secondary Structure

Ke, Tiejun and Wang, Changwu and Liu, Wenyuan and Liu, Jiaomin (2019) Fast Algorithm for the Minimum Chebyshev Distance in RNA Secondary Structure. In: Broadband Communications, Networks, and Systems. 10th EAI International Conference, Broadnets 2019, Xi’an, China, October 27-28, 2019, Proceedings.

[thumbnail of 35547.pdf] PDF
35547.pdf

Download (1MB)

Abstract

Minimum Chebyshev distance computation between base-pair and structures cost most time while comparing RNA secondary structures. We present a fast algorithm for speeding up the minimum Chebyshev distance computation. Based on the properties of RNA dot plots and Chebyshev distance, this algorithm uses binary search to reduce the size of base pairs and compute Chebyshev distances rapidly. Compared with O() time complexity of the original algorithm, the new one takes nearly [O(log), O(1)] time.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Date Deposited: 04 Mar 2026 12:44
Last Modified: 20 Nov 2026 10:59
URI: https://eprints.eai.eu/id/eprint/26176

Actions (login required)

View Item
View Item