Search Results for "graph isomorphism algorithm"

...The main challenge in this task lies in correcting retention time shifts, which are inevitable even on the same instrument and under the same elution conditions. For large-scale studies, multiple instruments or multi-week experiments are often required, which exacerbates the problem. We present a new graph-based time alignment algorithm that can align these less similar LC-MS maps, which cannot be effectively handled by existing methods.

With the rise of improved sequencing technologies, genomics is expanding from a single reference per species paradigm into a more comprehensive pan-genome approach with multiple individuals represented and analyzed together. Here we introduce a novel O(n log n) time and space algorithm called splitMEM, that directly constructs the compressed de Bruijn graph for a pan-genome of total length n. To achieve this time complexity, we augment the suffix tree with suffix skips, a new construct that allows us to traverse several suffix links in constant time, and use them to efficiently decompose maximal exact matches (MEMs) during a suffix tree traversal.

BIL++ is a set of standalone C++ packages for data processing in Bioinformatics (Graph mining, Bayesian networks, Genetic algorithm, Discretization, Gene expression data analysis, Hypothesis testing).