The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
It is difficult to compute large RNA molecules with pseudoknots in bioinformatics, the prediction of RNA structure with pseudoknots is an NP-hard problem. According to PTAS principle and MFE models, we investigate the RNA pseudoknotted structure. We first presents an efficient algorithm for predicting RNA structure with pseudoknots. The experimental tests in PseudoBases indicate that the algorithm...
Mapping multiple virtual network (VN) requests with constraints on virtual nodes and virtual links into a shared substrate network presents a significant challenge and is an NP-hard problem. In this paper, we propose a heuristic node and link mapping algorithm that handles online VN requests. The node mapping algorithm selects a substrate node that satisfies both a virtual node¡¦s resource requirement...
Localization is one of the most challenging and important issues in wireless sensor networks (WSNs), especially if cost-effective approaches are demanded. Range estimation is essential in many sensor network localization algorithms. Although wireless sensor systems usually have available received signal strength indication (RSSI) reading, but RSSI is susceptible to external influences, performances...
Tree similarity measurement is key to tree-like data mining. In order to maximally capture common information between trees, we consider the problem of computing all common embedded subtrees, and advocate using the number/count of all common embedded subtrees as a measure of similarity. This problem is not trivial due to the inherent complexity of trees and the ensued large search space. The problem...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.