2612 search results - page 4 / 523 » Assemblies as Graph Processes |
DNA
2006
Springer
13 years 11 months ago
2006
Springer
We study the complexity of the Accretive Graph Assembly Problem (AGAP). An instance of AGAP consists of an edge-weighted graph G, a seed vertex in G, and a temperature . The goal i...
CAINE
2008
13 years 9 months ago
2008
Assembly is an NP-Hard problem, which involves comparing fragments that have a time complexity of O(n2 ). This paper presents a parallel approach for sequence assembly. The parall...
WABI
2007
Springer
14 years 1 months ago
2007
Springer
Graph-theoretic models have come to the forefront as some of the most powerful and practical methods for sequence assembly. Simultaneously, the computational hardness of the underl...
BMCBI
2010
13 years 7 months ago
2010
Background: High throughput sequencing (HTS) platforms produce gigabases of short read (<100 bp) data per run. While these short reads are adequate for resequencing application...
WPES
2006
ACM
14 years 1 months ago
2006
ACM
Connections in distributed systems, such as social networks, online communities or peer-to-peer networks, form complex graphs. These graphs are of interest to scientists in field...