\begin{algorithmic}[1]
\Function {makeGraph}{$reads$}
\ForAll{$r$ in $reads$}
\ForAll{$kmer$ in $r$}
\State $left \gets s_{0}s_{1}\dots{}s_{k-2}$ //prefix
\State $right \gets s_{1}\dots{}s_{k-2}s_{k-1}$ //suffix
\State $addLeftVertex(left, s_{k-1})$
\State $addRightVertex(right)$
\State {// now both left and right vertex exist}
\State $left\_vertex \gets FindVertex(left)$
\State $right\_vertex \gets FindVertex(right)$
\State $left\_vertex.pointers[s_{k-1}] \gets right\_vertex$
\EndFor
\EndFor
\EndFunction
\end{algorithmic}

\begin{algorithmic}
[1]
\Function {makeGraph}{$reads$}
\ForAll{$r$ in $reads$}
\ForAll{$kmer$ in $r$}
\State $left \gets s_{0}s_{1}\dots{}s_{k-2}$ //prefix
\State $right \gets s_{1}\dots{}s_{k-2}s_{k-1}$ //suffix
\State $addLeftVertex(left, s_{k-1})$
\State $addRightVertex(right)$
\State {// now both left and right vertex exist}
\State $left\_vertex \gets FindVertex(left)$
\State $right\_vertex \gets FindVertex(right)$
\State $left\_vertex.pointers[s_{k-1}] \gets right\_vertex$
\EndFor
\EndFor
\EndFunction
\end{algorithmic}
{
    "title": "lock-free de bruijn graph",
    "id": "2401.02756",
    "abstract": "de bruijn graph is one of the most important data structures used in de-novo genome assembly algorithms, especially for ngs data. there is a growing need for parallel data structures and algorithms due to the increasing number of cores in modern computers. the assembly task is an indispensable step in sequencing genomes of new organisms and studying structural genomic changes. in recent years, the dynamic development of next-generation sequencing (ngs) methods raises hopes for making whole-genome sequencing a fast and reliable tool used, for example, in medical diagnostics. however, this is hampered by the slowness and computational requirements of the current processing algorithms, which raises the need to develop more efficient algorithms. one possible approach, still little explored, is the use of quantum computing.   we created the lock-free version of the de bruijn graph, as well as a lock-free algorithm to build such graph from reads. our algorithm and data structures are developed to use parallel threads of execution and do not use mutexes or other locking mechanisms, instead, we used only compare-and-swap instruction and other atomic operations. it makes our algorithm very fast and efficiently scaling.   the presented article depicts the new lock-free de bruijn graph data structure with a graph build algorithm. we developed a c++ library and tested its performance to depict its high speed and scalability compared to other available tools.",
    "categories": "cs.dc q-bio.gn",
    "doi": "",
    "created": "2024-01-05",
    "updated": "",
    "authors": [
        "daniel g\u00f3rniak",
        "robert nowak"
    ],
    "affiliation": [],
    "url": "https://arxiv.org/abs/2401.02756"
}
{
    "ToxicityFilter": {
        "text_to_toxicity_attributes": {
            "lfdb.bib": {
                "toxicity_score": 0.005026425,
                "severe_toxicity_score": 0.00088214874,
                "identity_attack_score": 0.0010451894,
                "insult_score": 0.0061448677,
                "profanity_score": 0.013234417,
                "threat_score": 0.0057606893,
                "sexually_explicit_score": 0.009613278,
                "flirtation_score": 0.20635706
            },
            "lfdb.bbl": {
                "toxicity_score": 0.012880214,
                "severe_toxicity_score": 0.0011968613,
                "identity_attack_score": 0.0042547537,
                "insult_score": 0.007816878,
                "profanity_score": 0.015283971,
                "threat_score": 0.0077154995,
                "sexually_explicit_score": 0.011323617,
                "flirtation_score": 0.1958164
            },
            "lfdb.tex": {
                "toxicity_score": 0.012126249,
                "severe_toxicity_score": 0.0011730194,
                "identity_attack_score": 0.0038292783,
                "insult_score": 0.0076838774,
                "profanity_score": 0.015488927,
                "threat_score": 0.007598988,
                "sexually_explicit_score": 0.01250316,
                "flirtation_score": 0.21894184
            }
        },
        "reason": null
    }
}
{
    "num_done": {
        "figure": 0,
        "algorithm": 3,
        "plot": 0
    }
}
{
    "NonTrivialRenderingFilter": {
        "white_pixels_ratio": 90.0524161150859,
        "hash": "03c081e1cfcf8f0f",
        "most_frequent_color_ratio": 90.0524161150859
    }
}