Open Access. Powered by Scholars. Published by Universities.®
- Publication Type
Articles 1 - 7 of 7
Full-Text Articles in Entire DC Network
Multiple Biolgical Sequence Alignment: Scoring Functions, Algorithms, And Evaluations, Ken D. Nguyen
Multiple Biolgical Sequence Alignment: Scoring Functions, Algorithms, And Evaluations, Ken D. Nguyen
Computer Science Dissertations
Aligning multiple biological sequences such as protein sequences or DNA/RNA sequences is a fundamental task in bioinformatics and sequence analysis. These alignments may contain invaluable information that scientists need to predict the sequences' structures, determine the evolutionary relationships between them, or discover drug-like compounds that can bind to the sequences. Unfortunately, multiple sequence alignment (MSA) is NP-Complete. In addition, the lack of a reliable scoring method makes it very hard to align the sequences reliably and to evaluate the alignment outcomes.
In this dissertation, we have designed a new scoring method for use in multiple sequence alignment. Our scoring method …
Biological Network Motif Detection And Evaluation, Wooyoung Kim, Min Li, Jianxin Wang, Yi Pan
Biological Network Motif Detection And Evaluation, Wooyoung Kim, Min Li, Jianxin Wang, Yi Pan
Computer Science Faculty Publications
Background: Molecular level of biological data can be constructed into system level of data as biological networks. Network motifs are defined as over- represented small connected subgraphs in networks and they have been used for many biological applications. Since network motif discovery involves computationally challenging processes, previous algorithms have focused on computational efficiency. However, we believe that the biological quality of network motifs is also very important.
Results: We define biological network motifs as biologically significant subgraphs and traditional network motifs are differentiated as structural network motifs in this paper. We develop five algorithms, namely, EDGEGO-BNM, EDGEBETWEENNESS-BNM, NMF-BNM, NMFGO-BNM and …
Parallel Progressive Multiple Sequence Alignment On Reconfigurable Meshes, Ken Nguyen, Yi Pan, Ge Nong
Parallel Progressive Multiple Sequence Alignment On Reconfigurable Meshes, Ken Nguyen, Yi Pan, Ge Nong
Computer Science Faculty Publications
Background: One of the most fundamental and challenging tasks in bio-informatics is to identify related sequences and their hidden biological significance. The most popular and proven best practice method to accomplish this task is aligning multiple sequences together. However, multiple sequence alignment is a computing extensive task. In addition, the advancement in DNA/RNA and Protein sequencing techniques has created a vast amount of sequences to be analyzed that exceeding the capability of traditional computing models. Therefore, an effective parallel multiple sequence alignment model capable of resolving these issues is in a great demand.
Results: We design O(1) run-time solutions …
A Comparison Of The Functional Modules Identified From Time Course And Static Ppi Network Data, Xiwei Tang, Jianxin Wang, Binbin Liu, Min Li, Gang Chen, Yi Pan
A Comparison Of The Functional Modules Identified From Time Course And Static Ppi Network Data, Xiwei Tang, Jianxin Wang, Binbin Liu, Min Li, Gang Chen, Yi Pan
Computer Science Faculty Publications
Background: Cellular systems are highly dynamic and responsive to cues from the environment. Cellular function and response patterns to external stimuli are regulated by biological networks. A protein-protein interaction (PPI) network with static connectivity is dynamic in the sense that the nodes implement so-called functional activities that evolve in time. The shift from static to dynamic network analysis is essential for further understanding of molecular systems.
Results: In this paper, Time Course Protein Interaction Networks (TC- PINs) are reconstructed by incorporating time series gene expression into PPI networks. Then, a clustering algorithm is used to create functional modules from three …
Identifying Protein Complexes From Interaction Networks Based On Clique Percolation And Distance Restriction, Jianxin Wang, Binbin Liu, Min Li, Yi Pan
Identifying Protein Complexes From Interaction Networks Based On Clique Percolation And Distance Restriction, Jianxin Wang, Binbin Liu, Min Li, Yi Pan
Computer Science Faculty Publications
Background: Identification of protein complexes in large interaction networks is crucial to understand principles of cellular organization and predict protein functions, which is one of the most important issues in the post-genomic era. Each protein might be subordinate multiple protein complexes in the real protein-protein interaction networks.Identifying overlapping protein complexes from protein-protein interaction networks is a considerable research topic.
Result: As an effective algorithm in identifying overlapping module structures, clique percolation method (CPM) has a wide range of application in social networks and biological networks. However, the recognition accuracy of algorithm CPM is lowly. Furthermore, algorithm CPM is unfit to …
An Improved Ant Colony Algorithm With Diversified Solutions Based On The Immune Strategy, Ling Qin, Yi Pan, Ling Chen, Yixin Chen
An Improved Ant Colony Algorithm With Diversified Solutions Based On The Immune Strategy, Ling Qin, Yi Pan, Ling Chen, Yixin Chen
Computer Science Faculty Publications
Background: Ant colony algorithm has emerged recently as a new meta- heuristic method, which is inspired from the behaviours of real ants for solving NP-hard problems. However, the classical ant colony algorithm also has its defects of stagnation and premature. This paper aims at remedying these problems.
Results: In this paper, we propose an adaptive ant colony algorithm that simulates the behaviour of biological immune system. The solutions of the problem are much more diversified than traditional ant colony algorithms.
Conclusion: The proposed method for improving the performance of traditional ant colony algorithm takes into account the polarization of the …
A Novel Approach To Phylogenetic Tree Construction Using Stochastic Optimization And Clustering, Ling Qin, Yixin Chen, Yi Pan, Ling Chen
A Novel Approach To Phylogenetic Tree Construction Using Stochastic Optimization And Clustering, Ling Qin, Yixin Chen, Yi Pan, Ling Chen
Computer Science Faculty Publications
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational biology.
Results: A new phylogenetic tree construction method from a given set of objects (proteins, species, etc.) is presented. As an extension of ant colony optimization, this method proposes an adaptive phylogenetic clustering algorithm based on a digraph to find a tree structure that defines the ancestral relationships among the given objects.
Conclusion: Our phylogenetic tree construction method is tested to compare its results with that of the genetic algorithm (GA). Experimental results show that …