nsearch statistics

To access cutting-edge analytics on consensus tools, life science contexts and associated fields, you will need to subscribe to our premium service.

Subscribe
info

Citations per year

Citations chart
info

Popular tool citations

chevron_left Biomedical entity search File filtering File merging chevron_right
Popular tools chart
info

Tool usage distribution map

Tool usage distribution map
info

Associated diseases

Associated diseases

nsearch specifications

Information


Unique identifier OMICS_31534
Name nsearch
Software type Application/Script
Interface Command line interface
Restrictions to use None
Operating system Unix/Linux
Programming languages C++
License BSD 3-clause “New” or “Revised” License
Computer skills Advanced
Stability Stable
Maintained Yes

Download


Versioning


Add your version

Documentation


Maintainers


  • person_outline Steven Schmid <>
  • person_outline Timothy Julian <>

Publication for nsearch

nsearch in publications

 (4)
PMCID: 4990610
PMID: 27594883
DOI: 10.1186/s13634-016-0387-2

[…] {\lambda}_2^2 $$\end{document}λ22 in [] is to reduce the noise effect to the non-principle singular values through average operation., let us analyze the complexity of csvr spectrum. let nsearch be the number of the chirp rate scanning points. for each scanning point, the flop count [] for hadamard product is mcnc. because the csvr spectrum only requires the singular values of y(μ) […]

PMCID: 4424485
PMID: 25939621
DOI: 10.1098/rsta.2014.0389

[…] term r(x)., the discrete representation of the st regularization term is based on nl gradient [,] and given by 2.8 where the search domain ns is restricted to the volumetric neighbourhood size of nsearch×nsearch×k with the number of neighbours equal to n2searchk. note that the volumetric search area ns includes all time-frames k. non-negative and symmetric weights ωi,j are calculated […]

PMCID: 4461426
PMID: 26078861
DOI: 10.1002/ece3.1514

[…] from original: “.$repeat_dif.”\n--------------------\n”;, }, }, }, else {$output.= join(“,”, @reference).”,no match\r”;}, print “\nremaining lookups: “.$#linesplit.”\n\n\n”;, }, }, print “\n\nsearch complete.\nexporting data to: “.$output_name;, open file, “>“.$output_name or die $!;, print file $output;, close file;, __end__, =head1 name, sample - using getopt::long and pod::usage, […]

PMCID: 3274214
PMID: 22319289
DOI: 10.3390/s100403100

[…] set of nodes that find the lowest cost paths is denoted by q., searching procedure for the optimal data report path is described as follows: initialize the network: (29)q=∅,   d0=0,   di=ωi0,i=1,2,⋯,nsearch for the next node with the lowest cost path to p0. for pi ∉ q, if di satisfies: (30)di=mink=1ndkthe lowest cost path of pi is found, update q: (31)q=q∪{pi}if q = p, then search is completed. […]


To access a full list of publications, you will need to upgrade to our premium service.

nsearch institution(s)
Department of Biosystems Science and Engineering, ETH Zürich, Zürich, Switzerland; Eawag, Swiss Federal Institute of Aquatic Science and Technology, Duebendorf, Switzerland; Swiss Tropical and Public Health Institute, Basel, Switzerland; University of Basel, Basel, Switzerland; Department of Biology, University of Turku, Turku, Finland
nsearch funding source(s)
Supported by the Bill and Melinda Gates Foundation grant OPP1151041 and the Swiss National Science Foundation (SNSF) through grant OP157065.

nsearch reviews

star_border star_border star_border star_border star_border
star star star star star

Be the first to review nsearch