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.
This paper presents an algorithm for detecting communities in bipartite network based on the suffix tree structure. The algorithm, first extracts the adjacent node sequence for reach node in the network. Based on the node sequences of all the nodes, the algorithm constructs a suffix tree, where each node represents a complete bipartite sub-graph in the network G. Then the algorithm adjusts those cliques...
An improved vehicle coordination strategy for vehicle routing problem (VRP) based on SWEEP was proposed in order to solving single-depot VRP with stochastic demands. In this strategy, the vehicle routing that customers were not served by basic vehicle (BV) is re-optimized using SWEEP rules, then these customers are severed by SWEEP vehicle (SV) in order that the total serve time will be less and the...
Biclustering the gene expressing data is an important task in bioinformatics. A parallel biclustering algorithm for gene expressing data is presented. The algorithm starts from the data sets containing pair of rows and columns of the data matrix, and gets the biclusters by gradually adding columns and rows on the data sets. A pruning technique is also proposed to reduce computing time. Experimental...
A biclustering algorithm for gene expressing data is presented. Based on the anti-monotones property of the quality of the data sets with their sizes, the algorithm can get the final biclusters by gradually adding columns and rows on the data sets. Experimental results show that our algorithm has higher processing speed and quality of clustering than other similar algorithms.
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.