4009 search results - page 50 / 802 » Clustering on Complex Graphs |
RECOMB
2008
Springer
16 years 3 days ago
2008
Springer
Abstract. Clusters of genes that evolved from single progenitors via repeated segmental duplications present significant challenges to the generation of a truly complete human geno...
RECOMB
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Clusters of genes that have evolved by repeated segmental duplication present difficult challenges throughout genomic analysis, from sequence assembly to functional analy...
CSE
2009
IEEE
15 years 3 months ago
2009
IEEE
An important aspect in social computing is the structure of social networks, which build the underlying substrate for the exchange of information. With the growing importance of mi...
112
click to vote
ISAAC
2007
Springer
15 years 6 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
168
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...