906 search results - page 36 / 182 » Map graphs |
WABI
2007
Springer
14 years 1 months ago
2007
Springer
In comparing genomic maps, it is often difficult to distinguish mapping errors and incorrectly resolved paralogies from genuine rearrangements of the genomes. A solution to this ...
PPOPP
1997
ACM
13 years 12 months ago
1997
ACM
Array remappings are useful to many applications on distributed memory parallel machines. They are available in High Performance Fortran, a Fortran-based data-parallel language. T...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
Previous studies on multi-instance learning typically treated instances in the bags as independently and identically distributed. The instances in a bag, however, are rarely indep...
GC
2010
Springer
13 years 6 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
GD
2004
Springer
14 years 1 months ago
2004
Springer
This paper describes a local update scheme for the algorithm of Sugiyama and Misue (IEEE Trans. on Systems, Man, and Cybernetics 21 (1991) 876–892) for drawing views of compound ...