Matt Ralston

Matt Ralston

M.Sc. Bioinfo + 5 years industry exp. - - - Looking for a position in biosciences. I'm gifted at the command line or computer terminal, but I perform best on my feet, standups, cleaning, guitar with samples in the centrifuge, more in the water bath, data being processed on the computer while I sleep, and other assays to plan. Currently writing a DNA sequence graph algorithm and manuscript (for bioRxiv). I play math rock on my guitar, I have some open-source software on GitHub, I pay my bills in the DE-NJ-PA tri-state area near Delco, and I'm launching a DE-based LLC for Univ. of Delaware and local NGS sequencing projects.

Ricing In 2024

less than 1 minute read

Published:

Customization is essential for maximizing visual appeal and ease of use of the computer system.

‘Ricing’ or system customization may be adding a new editor, or connecting an outside resource via an API token. It might be just configuring the environment and software to properly support each other, in an ideal DevOps situation. Adding software, hotkeys, or other system layers allows the user to combine functionality, when performing their tasks.

My customization goals:

I would like to produce lower quality terminal experiences, richer than average for web application servers, using a web service framework and ORM, and load balancing.

I’d like to familiarize myself with org templating to provide richer menu driven development and generative functions when working on workflow.

I’d like to eventually totally drive specific rich workflows with TUI and CLI experiences, monitoring, and then eventually dashboard around specific experiences I’d like to insource into a company.

You May Also Enjoy

Linear Runtimes For Quasimapping And Alignment Free

1 minute read

Published:

I want to discuss linear runtimes and what that means in alignment-free methods for bioinformatics and sequence alignments and quasi alignments. First, it is the splitting of the sequences, as they are read, into, let’s say, ‘a’ De Bruijn graph. This graph consists of the k-mers, their neighborhoods, and of course the walks or paths through the graph that constitute optimal criteria and local maxima of course for traversal and contig/walk/path maximization. Typically, a search through the De Bruijn structure may be Breadth-First to find optimal depths for traversal of the path through the De Bruijn structure, optimizing for creating some sequence. This leads to read collapse along the sequence unidirectionally (bidirectionally in a unidimensional space) along the sequence space.