Search
Search Results
-
Improving dynamic treatment unit forest planning with cellular automata heuristics
We present a model for conducting dynamic treatment unit (DTU) forest planning using a heuristic cellular automata (CA) approach. The clustering of...
-
Ensembles of Heuristics and Computational Optimisation in Highly Flexible Manufacturing System
The objective of a Flexible Manufacturing System (FMS) is to respond faster to changes in products and demands with minimum changeover cost. However,...
-
Perception of climate change-related forest dieback in mountain forests among the local population
Mountain forests provide multiple benefits but are threatened by climate change-induced forest dieback. Although many studies summarize perceptions...
-
No food left behind: foraging route choices among free-ranging Japanese macaques (Macaca fuscata) in a multi-destination array at the Awajishima Monkey Center, Japan
Animals must make route choices every day when moving through their habitat while foraging. Choosing an optimal route can be cognitively costly, and...
-
New Caledonian crows' basic tool procurement is guided by heuristics, not matching or tracking probe site characteristics
Contrasting findings made it unclear what cognitive processes New Caledonian crows use to procure suitable tools to solve tool tasks. Most previous...
-
Median quartet tree search algorithms using optimal subtree prune and regraft
Gene trees can be different from the species tree due to biological processes and inference errors. One way to obtain a species tree is to find one...
-
A survey of map** algorithms in the long-reads era
It has been over a decade since the first publication of a method dedicated entirely to map** long-reads. The distinctive characteristics of long...
-
Auditing local news presence on Google News
Local news outlets have struggled to stay open in the more competitive market of digital media. Some have noted that this decline may be due to the...
-
Flexible social inference facilitates targeted social learning when rewards are not observable
Groups coordinate more effectively when individuals are able to learn from others’ successes. But acquiring such knowledge is not always easy,...
-
Exact median-tree inference for unrooted reconciliation costs
BackgroundSolving median tree problems under tree reconciliation costs is a classic and well-studied approach for inferring species trees from...
-
Prediction of body weight from morphological traits of South African non-descript indigenous goats of Lepelle-Nkumbi Local Municipality using different data mining algorithm
Body weight is a vital trait which can assist farmers on selecting animals to use during breeding season. Therefore, the study was conducted to...
-
Molecular complex detection in protein interaction networks through reinforcement learning
BackgroundProteins often assemble into higher-order complexes to perform their biological functions. Such protein–protein interactions (PPI) are...
-
Heuristic algorithms for best match graph editing
BackgroundBest match graphs (BMGs) are a class of colored digraphs that naturally appear in mathematical phylogenetics as a representation of the...
-
Evolutionary origin and systematic position of Euphorbia normannii (Euphorbiaceae), an intersectional hybrid and local endemic of the Stavropol Heights (Northern Caucasus, Russia)
The Caucasus is one of the richest areas in the world in terms of animal and plant diversity, harbouring 6400 plant species. As a part of the...
-
Analysis of local genome rearrangement improves resolution of ancestral genomic maps in plants
BackgroundComputationally inferred ancestral genomes play an important role in many areas of genome research. We present an improved workflow for the...
-
Revisiting the complexity of and algorithms for the graph traversal edit distance and its variants
The graph traversal edit distance (GTED), introduced by Ebrahimpour Boroojeny et al. (2018), is an elegant distance measure defined as the minimum...
-
Evaluation of word embedding models to extract and predict surgical data in breast cancer
BackgroundDecisions in healthcare usually rely on the goodness and completeness of data that could be coupled with heuristics to improve the decision...
-
Heuristics for Breakpoint Graph Decomposition with Applications in Genome Rearrangement Problems
The breakpoint graph of a permutation is a well-known structure used in genome rearrangement problems. Most studies use the decomposition of such...
-
Cue: a deep-learning framework for structural variant discovery and genoty**
Structural variants (SVs) are a major driver of genetic diversity and disease in the human genome and their discovery is imperative to advances in...
-
LePrimAlign: local entropy-based alignment of PPI networks to predict conserved modules
BackgroundCross-species analysis of protein-protein interaction (PPI) networks provides an effective means of detecting conserved interaction...
