Results 91 to 100 of about 40,634 (160)

Expletive Constructions and Agreement in Labeling Theory

Studia Linguistica, Volume 80, Issue 1, April 2026.
ABSTRACT In this paper, I explain how agreement occurs in English expletive constructions, in accord with recent work in the Minimalist Program. I develop a proposal that relies on feature unification and probe‐goal agreement, as well as the notion that internal merge of arguments generally applies freely.
Jason Ginsburg
wiley   +1 more source

ChromoTrace: Computational reconstruction of 3D chromosome configurations for super-resolution microscopy.

PLoS Computational Biology, 2018
The 3D structure of chromatin plays a key role in genome function, including gene expression, DNA replication, chromosome segregation, and DNA repair.
Carl Barton, Sandro Morganella, Øyvind Ødegård-Fougner, Stephanie Alexander, Jonas Ries, Tomas Fitzgerald, Jan Ellenberg, Ewan Birney   +7 more
doaj   +1 more source

Forward genetic screening of mutants of the wild diploid ancestor Nicotiana sylvestris identifies aspartate oxidase 2 as a key gene for nicotine biosynthesis in cultivated allotetraploid tobacco (Nicotiana tabacum)

The Plant Journal, Volume 126, Issue 1, April 2026.
SUMMARY Tobacco (Nicotiana tabacum) is one of the most important commercial crops. It is an allotetraploid with two subgenomes derived from two wild diploid species: the maternal ancestor Nicotiana sylvestris and the paternal ancestor Nicotiana tomentosiformis.
Takanori Takeuchi, Hisashi Udagawa, Masao Arai, Ryo Nishiguchi, Tsubasa Yoshikiyo, Tomoyuki Tajima, Hiroshi Magome, Yoshimitsu Takakura   +7 more
wiley   +1 more source

Grammar Compression With Support to Fast Substring Extraction

IEEE Access
We present a simple grammar-based compression strategy derived from the factorization used in the DC3 suffix-sorting algorithm that supports fast substring extraction. The input string is partitioned into non-overlapping substrings of fixed length $X$ ,
Danyelle S. O. Angelo, Daniel S. N. Nunes, Guilherme P. Telles, Felipe A. Louza   +3 more
doaj   +1 more source

Random Access to Grammar Compressed Strings

, 2011
Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular compression schemes.
Bille, Philip, Landau, Gad M., Raman, Rajeev, Sadakane, Kunihiko, Satti, Srinivasa Rao, Weimann, Oren   +5 more
core   +1 more source

Full-fledged Real-Time Indexing for Constant Size Alphabets

, 2013
In this paper we describe a data structure that supports pattern matching queries on a dynamically arriving text over an alphabet ofconstant size. Each new symbol can be prepended to $T$ in O(1) worst-case time.
Kucherov, Gregory, Nekrich, Yakov
core   +1 more source

Fast, Small and Exact: Infinite-order Language Modelling with Compressed Suffix Trees

Transactions of the Association for Computational Linguistics, 2021
Ehsan Shareghi, Matthias Petri, Gholamreza Haffari, Trevor Cohn   +3 more
doaj   +1 more source

Relative Suffix Trees. [PDF]

Comput J, 2018
Farruggia A, Gagie T, Navarro G, Puglisi SJ, Sirén J.   +4 more
europepmc   +1 more source

DRIMust: a web server for discovering rank imbalanced motifs using suffix trees. [PDF]

Nucleic Acids Res, 2013
Leibovich L, Paz I, Yakhini Z, Mandel-Gutfreund Y.   +3 more
europepmc   +1 more source

FastGA: fast genome alignment. [PDF]

Bioinform Adv
Myers G, Durbin R, Zhou C.
europepmc   +2 more sources