Sciweavers

1282 search results - page 14 / 257
» Algorithms for Large, Sparse Network Alignment Problems
Sort
View
BMCBI
2008
122views more  BMCBI 2008»
13 years 7 months ago
Grammar-based distance in progressive multiple sequence alignment
Background: We propose a multiple sequence alignment (MSA) algorithm and compare the alignment-quality and execution-time of the proposed algorithm with that of existing algorithm...
David J. Russell, Hasan H. Otu, Khalid Sayood
JPDC
2007
167views more  JPDC 2007»
13 years 7 months ago
On the design of high-performance algorithms for aligning multiple protein sequences on mesh-based multiprocessor architectures
In this paper, we address the problem of multiple sequence alignment (MSA) for handling very large number of proteins sequences on mesh-based multiprocessor architectures. As the ...
Diana H. P. Low, Bharadwaj Veeravalli, David A. Ba...
RECOMB
2008
Springer
14 years 8 months ago
Fast and Accurate Alignment of Multiple Protein Networks
Comparative analysis of protein networks has proven to be a powerful approach for elucidating network structure and predicting protein function and interaction. A fundamental chall...
Maxim Kalaev, Vineet Bafna, Roded Sharan
ICRA
2007
IEEE
180views Robotics» more  ICRA 2007»
14 years 1 months ago
Mobile Sensor Networks Self Localization based on Multi-dimensional Scaling
— In this paper, we define a mobile self-localization (MSL) problem for sparse mobile sensor networks, and propose an algorithm named Mobility Assisted MDS-MAP(P), based on Mult...
Changhua Wu, Weihua Sheng, Ying Zhang
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong