I was looking up other algorithms used for layout. I am trying to figure out whether some of these algorithms would provide a ‘better’ layout for de bruijn graphs. Something that approaches the ones shown in
I am listing some of the libraries I found in igraph and tulip, not sure if any of these would do a better job (not knowing much about their difference and their relation to the ones used in graphviz). I was wondering if someone with more experience with layout algorithms might provide some insight, and whether there are better algorithms that might be worth trying out.
igraph:
Method name  Short name  Algorithm description 

layout_circle 
circle , circular

Deterministic layout that places the vertices on a circle 
layout_drl 
drl 
The Distributed Recursive Layout algorithm for large graphs 
layout_fruchterman_reingold 
fr 
FruchtermanReingold forcedirected algorithm 
layout_fruchterman_reingold_3d 
fr3d , fr_3d

FruchtermanReingold forcedirected algorithm in three dimensions 
layout_grid_fruchterman_reingold 
grid_fr 
FruchtermanReingold forcedirected algorithm with grid heuristics for large graphs 
layout_kamada_kawai 
kk 
KamadaKawai forcedirected algorithm 
layout_kamada_kawai_3d 
kk3d , kk_3d

KamadaKawai forcedirected algorithm in three dimensions 
layout_lgl 
large , lgl , large_graph

The Large Graph Layout algorithm for large graphs 
layout_random 
random 
Places the vertices completely randomly 
layout_random_3d 
random_3d 
Places the vertices completely randomly in 3D 
layout_reingold_tilford 
rt , tree

ReingoldTilford tree layout, useful for (almost) treelike graphs 
layout_reingold_tilford_circular 
rt_circular tree

ReingoldTilford tree layout with a polar coordinate posttransformation, useful for (almost) treelike graphs 
layout_sphere 
sphere , spherical , circular_3d

Deterministic layout that places the vertices evenly on the surface of a sphere 
tulip:
Layout
Tulip allows the visualization of information, and thus, provides several layout algorithms to display information and data in a neat fashion.
 Basic :The standard functions can be found in this sub group such as the Circular display or the Random layout .
 Force Directed :These layouts will try to place nodes so that the distance in the graph (specific metric on the edges) should be the closest to the distance on the drawing. Known such algorithm are the FM^3, the GEM Frick and the Kamada Kawai.
 Hierarchical :Those representations, in accord to their name, are perfect for presenting hierarchical structures or graph showing precedence relationships. The Balloon and the Sugiyama algorithms are good examples of such layout.
 Misc :This sub group contains miscellaneous algorithms, notably the packing and overlap removal algorithms.
 Multilevel :Multilevel layout is computed by including gradually the initial nodes into a layout, thus iteratively improving the node placement. The MMM and the fast multipole layout follow these steps. The iterativity allows to gradually enhance the representation.
 Planar :These algorithms are specialized in generating aesthetic planar layouts. With minimized edge crossings, those representations offer understandable 2D visualizations.
 Tree :As indicated by the sub group name, these layouts are particularly suited to trees or hierarchical data. They can be applied to any graph because if a graph is not tree it is internally applied to a spanning tree of each of its connected components.
graphviz:
dot  “hierarchical” or layered drawings of directed graphs. This is the default tool to use if edges have directionality.
neato  "spring model’’ layouts. This is the default tool to use if the graph is not too large (about 100 nodes) and you don’t know anything else about it. Neato attempts to minimize a global energy function, which is equivalent to statistical multidimensional scaling.
fdp  "spring model’’ layouts similar to those of neato, but does this by reducing forces rather than working with energy.
sfdp  multiscale version of fdp for the layout of large graphs.
twopi  radial layouts, after Graham Wills 97. Nodes are placed on concentric circles depending their distance from a given root node.
circo  circular layout, after Six and Tollis 99, Kauffman and Wiese 02. This is suitable for certain diagrams of multiple cyclic structures, such as certain telecommunications networks.