Results 81 to 90 of about 18,471 (230)
Reference-free phylogeny from sequencing data
Motivation Clustering of genetic sequences is one of the key parts of bioinformatics analyses. Resulting phylogenetic trees are beneficial for solving many research questions, including tracing the history of species, studying migration in the past, or ...
Petr Ryšavý, Filip Železný
doaj +1 more source
Graphonological Levenshtein Edit Distance: Application for Automated Cognate Identification [PDF]
This paper presents a methodology for calculating a modified Levenshtein edit distance between character strings, and applies it to the task of automated cognate identification from non-parallel (comparable) corpora.
Babych, B
core
Identifying Web Tables - Supporting a Neglected Type of Content on the Web
The abundance of the data in the Internet facilitates the improvement of extraction and processing tools. The trend in the open data publishing encourages the adoption of structured formats like CSV and RDF.
A Silva +5 more
core +1 more source
We present a novel approach for co‐transcriptional incorporation of locked nucleic acid (LNA) and 2′‐fluoro (2′F) modifications using a mutant T7 RNA polymerase. This method is compatible with in vitro selection and enables efficient, primer‐independent synthesis and amplification of LNA‐modified RNA aptamers with enhanced stability, targeting ...
Kevin Neis +8 more
wiley +1 more source
GPU acceleration of Levenshtein distance computation between long strings
Computing edit distance for very long strings has been hampered by quadratic time complexity with respect to string length. The WFA algorithm reduces the time complexity to a quadratic factor with respect to the edit distance between the strings. This work presents a GPU implementation of the WFA algorithm and a new optimization that can halve the ...
openaire +4 more sources
Abstract Natural history museums curate billions of insect specimens, representing an unparalleled record of biodiversity. Although large‐scale digitization has expanded access to specimen images, extracting label metadata remains a major bottleneck, typically requiring time‐intensive manual transcription.
Margot Belot +7 more
wiley +1 more source
One-Gapped q-Gram Filters for Levenshtein Distance [PDF]
We have recently shown that q- gram filters based on gapped q-grams instead of the usual contiguous q-grams can provide orders of magnitude faster and/or more efficient filtering for the Hamming distance. In this paper, we extend the results for the Levenshtein distance, which is more problematic for gapped q-grams because an insertion or deletion in a
Burkhardt, S., Kärkkäinen, J.
openaire +2 more sources
Abstract This article addresses bias in Spoken Language Systems (SLS) that involve both Automatic Speech Recognition (ASR) and Natural Language Processing (NLP) and reports experiments to improve the performance of SLS for automated language and literacy‐related assessments with students who are under served in the U.S. educational system.
Alison L. Bailey +5 more
wiley +1 more source
Creating a new Ontology: a Modular Approach [PDF]
Creating a new Ontology: a Modular ApproachComment: in Adrian Paschke, Albert Burger, Andrea Splendiani, M. Scott Marshall, Paolo Romano: Proceedings of the 3rd International Workshop on Semantic Web Applications and Tools for the Life Sciences ...
Dmitrieva, Julia, Verbeek, Fons J.
core +2 more sources
Single‐cell RNA/TCR/BCR sequencing reveals that 5CAR therapy in T‐ALL induces T‐cell exhaustion, reduces EBV‐associated TCRs, lowers TCR/BCR diversity, and increases NK/DC/monocyte activation and function. In contrast, 7CAR therapy reduces multiple pathogen‐associated TCRs, enhances NK cell activation and function, decreases monocyte activation, and ...
Yuechen Luo +12 more
wiley +1 more source

