Results 1 to 10 of about 294,257 (261)
Efficient algorithms for polyploid haplotype phasing [PDF]
Background Inference of haplotypes, or the sequence of alleles along the same chromosomes, is a fundamental problem in genetics and is a key component for many analyses including admixture mapping, identifying regions of identity by descent and ...
Dan He +3 more
doaj +2 more sources
Efficient Algorithms for Subgraph Listing [PDF]
Subgraph isomorphism is a fundamental problem in graph theory. In this paper we focus on listing subgraphs isomorphic to a given pattern graph. First, we look at the algorithm due to Chiba and Nishizeki for listing complete subgraphs of fixed size, and ...
Niklas Zechner, Andrzej Lingas
doaj +4 more sources
Efficient Algorithms for Permutation Arrays from Permutation Polynomials [PDF]
We develop algorithms for computing permutation polynomials (PPs) using normalization, so-called F-maps and G-maps, and the Hermite criterion. This allows for a more efficient computation of PPs for larger degrees and for larger finite fields.
Sergey Bereg +3 more
doaj +2 more sources
A novel methodology for optimum energy consumption in wireless sensor networks [PDF]
Purpose – The purpose of this paper is to minimize energy usage by maximizing network life in the creation of applications and protocols Design/methodology/approach – This paper presents a novel methodology for optimum energy consumption in wireless ...
Mohamed Abbas, Nasser Otayf
doaj +1 more source
Summary: We present Raptor, a system for approximately searching many queries such as next-generation sequencing reads or transcripts in large collections of nucleotide sequences. Raptor uses winnowing minimizers to define a set of representative k-mers,
Enrico Seiler +4 more
doaj +1 more source
Efficient Algorithms for Data Processing under Type-3 (and Higher) Fuzzy Uncertainty
It is known that, to more adequately describe expert knowledge, it is necessary to go from the traditional (type-1) fuzzy techniques to higher-order ones: type-2, probably type-3 and even higher.
Vladik Kreinovich +3 more
doaj +1 more source
In this paper, we propose an efficient algorithm to accelerate the existing Broad Learning System (BLS) algorithm for new added nodes. The existing BLS algorithm computes the output weights from the pseudoinverse with the ridge regression approximation ...
Hufei Zhu +3 more
doaj +1 more source
Efficient algorithms for quantum information bottleneck [PDF]
The ability to extract relevant information is critical to learning. An ingenious approach as such is the information bottleneck, an optimisation problem whose solution corresponds to a faithful and memory-efficient representation of relevant information
Masahito Hayashi, Yuxiang Yang
doaj +1 more source
Efficient Construction of the Equation Automaton
This paper describes a fast algorithm for constructing directly the equation automaton from the well-known Thompson automaton associated with a regular expression.
Faissal Ouardi +2 more
doaj +1 more source
Efficient and Self-Recursive Delay Vandermonde Algorithm for Multi-Beam Antenna Arrays
This paper presents a self-contained factorization for the delay Vandermonde matrix (DVM), which is the super class of the discrete Fourier transform, using sparse and companion matrices. An efficient DVM algorithm is proposed to reduce the complexity of
Sirani M. Perera +2 more
doaj +1 more source

