Zobrazeno 1 - 10
of 403
pro vyhledávání: '"Wan Andrew"'
Publikováno v:
BMC Bioinformatics, Vol 7, Iss Suppl 4, p S4 (2006)
Abstract Background Searching for the longest common sequence (LCS) of multiple biosequences is one of the most fundamental tasks in bioinformatics. In this paper, we present a parallel algorithm named FAST_LCS to speedup the computation for finding
Externí odkaz:
https://doaj.org/article/dfc264ab7a144869a5bfbfaef4619528
Autor:
Du, Chan, Choy, Kelene K.L., Chew, Lamony J.M., Antipina, Maria N., Chng, Valerie J.Y., Su, Sebastian H.A., Tai, Benjamin C.U., Osen, Raffael, Sugii, Shigeki, Wan, Andrew C.A.
Publikováno v:
In Journal of Food Engineering November 2023 357
Autor:
Chng, Valerie J.Y., Wan, Andrew C.A.
Publikováno v:
In Journal of Food Engineering November 2023 357
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
World Journal of Surgical Oncology, Vol 3, Iss 1, p 24 (2005)
Abstract Background Inflammatory myofibroblastic tumour (IMT) is a benign, nonmetastasizing proliferation of myofibroblasts with a potential for local infiltration, recurrence and persistent local growth. Case report We report a case of a 51 year-old
Externí odkaz:
https://doaj.org/article/1cac6d5410f541b5a5b98329fd399d3e
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We give a new bound on the sum of the linear Fourier coefficients of a Boolean function in terms of its parity decision tree complexity. This result generalizes an inequality of O'Donnell and Servedio for regular decision trees. We use this bound to
Externí odkaz:
http://arxiv.org/abs/1506.01055
We present an approach to extract measured information from text (e.g., a 1370 degrees C melting point, a BMI greater than 29.9 kg/m^2 ). Such extractions are critically important across a wide range of domains - especially those involving search and
Externí odkaz:
http://arxiv.org/abs/1505.01072
We present an explicit pseudorandom generator for oblivious, read-once, width-$3$ branching programs, which can read their input bits in any order. The generator has seed length $\tilde{O}( \log^3 n ).$ The previously best known seed length for this
Externí odkaz:
http://arxiv.org/abs/1405.7028
A function $f$ is $d$-resilient if all its Fourier coefficients of degree at most $d$ are zero, i.e., $f$ is uncorrelated with all low-degree parities. We study the notion of $\mathit{approximate}$ $\mathit{resilience}$ of Boolean functions, where we
Externí odkaz:
http://arxiv.org/abs/1405.5268