paper-with-me

홈 › Papers

Sneak peek at the tig sequences: useful sequences built from nucleic acid data

2022-09-13 · Camille Marchet

This manuscript is a tutorial on tig sequences that emerged after the name "contig", and are of diverse purposes in sequence bioinformatics. We review these different sequences (unitigs, simplitigs, monotigs, omnitigs to cite a few), give intuitions of their construction and interest, and provide some examples of applications.

📄 PDF Abstract BibTeX arXiv:2209.06318

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

SneakPeek: Interest Mining of Images based on User Interaction

2017-12-10 · Shahrokhian Daniyal, de Juan Alejandro Vera

Nowadays, eye tracking is the most used technology to detect areas of interest. This kind of technology requires specialized equipment recording user's eyes. In this paper, we propose SneakPeek, a different approach to d…

SneakPeek: Future-Guided Instructional Streaming Video Generation

2025-12-15 · Cheeun Hong, German Barquero, Fadime Sener, Markos Georgopoulos 외 arxiv

Instructional video generation is an emerging task that aims to synthesize coherent demonstrations of procedural activities from textual descriptions. Such capability has broad implications for content creation, educatio…

Video Generation

TMO --- The Federated Ontology of the TrendMiner Project

2014-05-01 · LREC 2014 5 · Hans-Ulrich Krieger, Thierry Declerck

This paper describes work carried out in the European project TrendMiner which partly deals with the extraction and representation of real time information from dynamic data streams. The focus of this paper lies on the c…

SneakySnake: A Fast and Accurate Universal Genome Pre-Alignment Filter for CPUs, GPUs, and FPGAs

2019-10-20 · Mohammed Alser, Taha Shahroodi, Juan Gomez-Luna, Can Alkan 외

Motivation: We introduce SneakySnake, a highly parallel and highly accurate pre-alignment filter that remarkably reduces the need for computationally costly sequence alignment. The key idea of SneakySnake is to reduce th…

CPUGPU

Dynamic Move Chains -- a Forward Pruning Approach to Tree Search in Computer Chess

2014-03-04 · Kieran Greer

This paper proposes a new mechanism for pruning a search game-tree in computer chess. The algorithm stores and then reuses chains or sequences of moves, built up from previous searches. These move sequences have a built-…

Position