Search Results for "graph path"

... * Quickly navigate your GPS files using embedded file/track/metadata browser * Works with gpx, kml, and csv files * Show overview map of all tracks in directory * Filter tracks in browser based on metadata, location, and path * Color code track overview based on metadata, e.g., overall distance, start time * Simultaneously view one or more tracks on map while graphing detailed metadata (e.g., speed, elevation, hill gradient) * Quickly determine distance and duration for portions of tracks by mousing or dragging in the graph. Use this to see exactly how different routes compare in time and distance Written in WxPython+Matplotlib. ...

xPyder is a PyMOL plugin to analyze and visualize on the 3D structure dynamical cross-correlation matrices (DCCM), linear mutual information (LMI), communication propensities (CP), intra- and inter-molecular interactions (e.g. PSN), and more, to produce highly customizable publication-quality images. xPyder identifies networks (using concepts from graph theory, such as hubs and shortest path searching), compares matrices and focuses the analysis on relevant information by filtering the data using a modular, user-expandable plugin system that takes advantage of structural and dynamical information, contributing to bridge the gap between dynamical and mechanical properties at the molecular level.

Mix is a tool that combines two or more draft assemblies, without relying on a reference genome and has the goal to reduce contig fragmentation and thus speed-up genome finishing. The proposed algorithm builds an extension graph where vertices represent extremities of contigs and edges represent existing alignments between these extremities. These alignment edges are used for contig extension. The resulting output assembly corresponds to a path in the extension graph that maximizes the cumulative contig length. Please note that Mix has moved to: https://github.com/massyah/MIX

boost_graph tried to wrap the C++ Boost Graph library in Python, providing graph algorithms like Breadth First Search, DFS, Shortest Path, Topological sort. This project is dead (http://bayleshanks.com/pamv1)