Results 71 to 80 of about 70,377,857 (147)
Evaluating Large‐Language Models in Bioinformatics Applications
Advanced Computing, Volume 1, Issue 1, December 2026.This work systematically evaluates advanced large language models across six representative bioinformatics tasks, from drug–drug interaction prediction and molecular optimization to single‐cell annotation and computational biology problem solving. The benchmark quantifies both their promise and limitations, offering practical guidance for prompt design,
Hengchuang Yin +9 more
wiley +1 more source
Combinatorics on partial word borders
Theoretical Computer Science, 2016 A partial word contains holes that can be filled with any character of the alphabet, a border is a non-empty proper prefix that is also a suffix, and the border array contains the length of the longest border of each prefix of the word. The authors determine the maximal number of holes with specified longest border, in particular in an unbordered ...
Emily Allen +5 more
openaire +3 more sources
Mixed Steiner Triple Systems With Shortest Length
Journal of Combinatorial Designs, Volume 34, Issue 12, Page 533-544, December 2026.ABSTRACT A mixed Steiner triple system is a 3‐GDD which is viewed as a code with minimum Hamming distance 3. These codes are the minimum weight codewords of a 1‐perfect code over a mixed alphabet, when the related codes exist, and provide the connection between 3‐GDDs and coding theory.
Tuvi Etzion
wiley +1 more source
Conjugates of characteristic Sturmian words generated by morphisms [PDF]
, 2004 This article is concerned with characteristic Sturmian words of slope α and 1-α (denoted by cα and c1-α resp.), where α∈(0,1) is an irrational number such that α=[0;1+d1,d2,..., dn] with dn≥d1≥1.
Amy Glen, Glen, Amy Louise, Glen, A.
core +1 more source
Characterizing Pyramidal Hadamard Designs With the Largest Number of Fixed Points
Journal of Combinatorial Designs, Volume 34, Issue 12, Page 569-573, December 2026.ABSTRACT A symmetric ( v , k , λ )‐design is said to be f‐pyramidal, with f < v − 1, under the action of a group G if G acts as an automorphism group fixing f points and acting sharply transitively on the remaining ones. We show that, necessarily, f ≤ v − 2 ( k − λ ). In particular, for a Hadamard design with parameters ( v , k , λ ) = ( 4 m − 1 , 2 m −
Tommaso Traetta
wiley +1 more source
Journal of Graph Theory, Volume 113, Issue 4, Page 553-570, December 2026.ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]. We take
Yixin Cao, Shenghua Wang
wiley +1 more source
Tree Independence Number III. Thetas, Prisms and Stars
Journal of Graph Theory, Volume 113, Issue 4, Page 619-633, December 2026.ABSTRACT We prove that for every t ∈ N there exists τ = τ ( t ) ∈ N such that every (theta, prism, K 1 , t)‐free graph has tree independence number at most τ (where we allow “prisms” to have one path of length zero).
Maria Chudnovsky +2 more
wiley +1 more source
Order and quasiperiodicity in episturmian words [PDF]
, 2007 We prove a refinement of a recent characterization of infinite episturmian words via lexicographic orderings (Glen-Justin-Pirillo, 2007). This allows us to easily characterize the strict episturmian words that are "infinite Lyndon words", i.e., those ...
Glen, A.
core
Abstract numeration systems and combinatorics on words
, 2010 We summary the main properties of abstract numeration systems and their links to combinatorics on words and combinatorial game ...
Rigo, Michel
core +1 more source
Simple juntas for shifted families
Discrete Analysis, 2020 **For the moment the link is to the submitted version of the article. It will be updated when the final version has been posted to arXiv.** Simple juntas for shifted families, Discrete Analysis 2020:14, 18 pp.
Peter Frankl, Andrey Kupavskii
doaj +1 more source