We introduce a normalized version of the LCS metric as a new local similarity measure for comparing two RNAs. An O(n2m lgm) time algorithm is presented for computing the maximum normalized score of two RNA sequences, where n and m are the lengths of the sequences and n ≤ m. This algorithm has the same time complexity as the currently best known global LCS algorithm.

In this paper, we propose a normalized a posteriori probability (APP) based algorithm for the decoding of low-density parity check (LDPC) codes. The normalized APP-based algorithm utilizes normalization to improve the accuracy of the soft values delivered by the simplified APP-based algorithm from one iteration to another during the iterative decoding, and can achieve very good tradeoff between...

This paper examines the problem of rapid frame and symbol synchronization techniques intended particularly for constant envelope modulation formats M–CPFSK with modulation index h=1/M which are used in strictly bandwidth limited narrowband industrial applications. The data aided and non data aided versions of the algorithm based on digital frequency discrimination are discussed and compared aga...

background and objectives: accurate detection of type and severity of hepatitis is crucial for effective treatment of the disease. while several computational algorithms for detection of hepatitis have been proposed to date, their limited performance leaves room for further improvement. this paper proposes a novel computational method for the diagnosis of hepatitis b using pattern detection tec...

many shape and topology optimization methods have been inspired from the nature. in this paper, two different optimization algorithms based on the adaptive biological growth (abg) have been applied to some structural elements. the first algorithm is developed for the shape optimization and is applied to a plate with a central hole as well as a fillet plate. the second algorithm is the soft kill...