|
algorithms |
8 |
|
transcription factor |
7 |
|
amino acid motifs |
6 |
|
binding sites |
6 |
|
models, chemical |
6 |
|
pattern recognition, automated - methods |
6 |
|
proteins - chemistry |
6 |
|
sequence analysis, protein - methods |
6 |
|
amino acid sequence |
5 |
|
base sequence |
5 |
|
binding energy |
5 |
|
binding sites - genetics |
5 |
|
boundary smoothness |
5 |
|
de-interlacing methods |
5 |
|
dna microarray |
5 |
|
edge dependent interpolation |
5 |
|
merging criterion |
5 |
|
molecular sequence data |
5 |
|
motif finding |
5 |
|
motion adaptive interpolation |
5 |
|
optimal number of segments |
5 |
|
protein interaction mapping - methods |
5 |
|
protein structure, tertiary |
5 |
|
proteins - chemistry - metabolism |
5 |
|
software |
5 |
|
watershed segmentation |
5 |
|
binding site |
4 |
|
computational biology |
4 |
|
contour measurement |
4 |
|
database systems |
4 |
|
decentralized control |
4 |
|
dna - genetics - metabolism |
4 |
|
dna sequences |
4 |
|
dynamic programming |
4 |
|
edge detection |
4 |
|
indexing (of information) |
4 |
|
models, statistical |
4 |
|
motif finding(discovering) |
4 |
|
np-complete |
4 |
|
object-based retrieval system |
4 |
|
probabilistic logics |
4 |
|
promoter regions, genetic |
4 |
|
protein binding |
4 |
|
real time systems |
4 |
|
sequence alignment - methods |
4 |
|
sequence analysis, dna - methods |
4 |
|
text-based matching |
4 |
|
transcription factors - chemistry |
4 |
|
adaptive phentype testing |
3 |
|
alignment |
3 |
|
alternative splicing |
3 |
|
approximation theory |
3 |
|
assembling |
3 |
|
binning |
3 |
|
building block |
3 |
|
cameras |
3 |
|
cluster analysis |
3 |
|
color |
3 |
|
combinatorial group testing |
3 |
|
competitive ratio |
3 |
|
complexity |
3 |
|
computational biology - methods |
3 |
|
computational geometry |
3 |
|
computational molecular biology |
3 |
|
conseved metabolic pathways |
3 |
|
contour dynamics |
3 |
|
core protein |
3 |
|
data mining - methods |
3 |
|
databases, genetic |
3 |
|
de bruijn graph |
3 |
|
de novo assembly |
3 |
|
de novo transcriptome assembly |
3 |
|
dna - chemistry |
3 |
|
dna composition features |
3 |
|
environmental genomics |
3 |
|
environmental microbiology |
3 |
|
escherichia coli - classification - genetics - isolation and purification |
3 |
|
escherichia coli - genetics |
3 |
|
experimentation |
3 |
|
genome |
3 |
|
genome assembly |
3 |
|
genome, bacterial |
3 |
|
genome, bacterial - genetics |
3 |
|
genomic rearrangements |
3 |
|
greedy-like prediction |
3 |
|
high throughput short reads |
3 |
|
isoforms |
3 |
|
k-mean clustering |
3 |
|
knock-out study |
3 |
|
knockout study |
3 |
|
l-mer |
3 |
|
lactobacillus - genetics |
3 |
|
look ahead technology |
3 |
|
markov chains |
3 |
|
mate-pair |
3 |
|
mathematics |
3 |
|
measurement |
3 |
|
metabolic network |
3 |
|
metagenomics |
3 |
|
metagenomics - methods |
3 |
|
metatranscriptomic reads |
3 |
|
models, biological |
3 |
|
models, theoretical |
3 |
|
modified chebychev distance |
3 |
|
monotone hazard rate |
3 |
|
motif pair |
3 |
|
multiprotein complexes - chemistry - metabolism |
3 |
|
next generation sequencing |
3 |
|
next-generation sequencing |
3 |
|
non-adaptive complex group testing |
3 |
|
object detection |
3 |
|
online selling |
3 |
|
parameterized templates |
3 |
|
pattern recognition |
3 |
|
performance |
3 |
|
phylogenetic tree reconstruction |
3 |
|
pooling design |
3 |
|
ppi network |
3 |
|
protein complexes |
3 |
|
protein domain |
3 |
|
protein interaction mapping |
3 |
|
protein linkage |
3 |
|
protein sequence alignment |
3 |
|
protein-protein interaction network |
3 |
|
reliability |
3 |
|
scheduling |
3 |
|
sequence analysis - methods |
3 |
|
sequence analysis, dna |
3 |
|
shadow detection |
3 |
|
shadow identification |
3 |
|
string graph |
3 |
|
variable overlap sizes |
3 |
|
vehicle tracking |
3 |
|
video segmentation |
3 |
|
1-space bounded |
2 |
|
2-trees |
2 |
|
aggregation |
2 |
|
algorithm |
2 |
|
anaerolinales |
2 |
|
anaerolineae |
2 |
|
animals |
2 |
|
approximation algorithm |
2 |
|
approximation algorithms |
2 |
|
approximation ratio |
2 |
|
approximation results |
2 |
|
assignment problems |
2 |
|
asymptotic competitive ratio |
2 |
|
asymptotic performance |
2 |
|
base line |
2 |
|
bayes theorem |
2 |
|
bin packing |
2 |
|
bin packing problem |
2 |
|
bin packing problems |
2 |
|
bounded degree graphs |
2 |
|
bounded mean |
2 |
|
bounded space |
2 |
|
call control |
2 |
|
carbohydrate metabolism |
2 |
|
cellular adhesion |
2 |
|
cellular network |
2 |
|
cellulolytic capacity |
2 |
|
chloroflexi |
2 |
|
coloring |
2 |
|
competitive algorithms |
2 |
|
competitive analysis |
2 |
|
complete binary tree |
2 |
|
computer animation |
2 |
|
computing methodologies |
2 |
|
consensus pattern |
2 |
|
conserved sequence |
2 |
|
conserved sequence - genetics |
2 |
|
design and analysis of algorithm |
2 |
|
design methodology |
2 |
|
deterministic online algorithms |
2 |
|
dilation |
2 |
|
directional antenna |
2 |
|
disks (machine components) |
2 |
|
dissolved oxygen |
2 |
|
distributed algorithm |
2 |
|
distributed algorithms |
2 |
|
drosophila - genetics - metabolism |
2 |
|
electrical engineering |
2 |
|
engineering |
2 |
|
feature of interest |
2 |
|
frequency division multiplexing |
2 |
|
gap ratio |
2 |
|
gene regulation |
2 |
|
gene regulatory |
2 |
|
glycoside hydrolase |
2 |
|
graph algorithm |
2 |
|
grid |
2 |
|
heuristics |
2 |
|
hierarchical merging |
2 |
|
hybrid algorithms |
2 |
|
hypercube |
2 |
|
image processing |
2 |
|
integer parameters |
2 |
|
interpolation |
2 |
|
lower and upper bounds |
2 |
|
lower bounds |
2 |
|
mathematics computers |
2 |
|
maximal degree |
2 |
|
median selection |
2 |
|
message complexity |
2 |
|
metagenomic |
2 |
|
metamorphosis |
2 |
|
minimum vertex cover |
2 |
|
motif discovering |
2 |
|
motifs discovering |
2 |
|
multi dimensional |
2 |
|
multigene family - genetics |
2 |
|
multiple sequence alignment |
2 |
|
np-hard |
2 |
|
object representation |
2 |
|
object representations |
2 |
|
on-line algorithms |
2 |
|
one-way trading |
2 |
|
online algorithms |
2 |
|
online call control |
2 |
|
online pricing |
2 |
|
optimal algorithms |
2 |
|
optimal results |
2 |
|
packing algorithms |
2 |
|
pattern analysis |
2 |
|
pinwheel |
2 |
|
planar graph |
2 |
|
point insertion |
2 |
|
polynomial-time algorithms |
2 |
|
pricing |
2 |
|
promoter regions, genetic - genetics |
2 |
|
proteins - genetics |
2 |
|
quadrilateral-based segmentation |
2 |
|
real-time |
2 |
|
regulatory sequences, nucleic acid - genetics |
2 |
|
ribonucleases - analysis - chemistry |
2 |
|
running time |
2 |
|
salinity |
2 |
|
satellite communication |
2 |
|
sequence alignment |
2 |
|
sequence homology |
2 |
|
shape transformation |
2 |
|
side length |
2 |
|
single-minded selling |
2 |
|
square grid |
2 |
|
square packing |
2 |
|
square packings |
2 |
|
temperature |
2 |
|
transcoding |
2 |
|
transcription factors - chemistry - genetics - metabolism |
2 |
|
transcription factors - chemistry - metabolism |
2 |
|
transcription factors - metabolism |
2 |
|
tree node assignment |
2 |
|
two dimensional bin packing |
2 |
|
two-dimensional planes |
2 |
|
uniformity |
2 |
|
unit prices |
2 |
|
value functions |
2 |
|
wideband code-division multiple-access |
2 |
|
wireless telecommunication systems |
2 |
|
3-sat |
1 |
|
analysis of algorithms |
1 |
|
approximate algorithm |
1 |
|
approximation |
1 |
|
arithmetic complexity |
1 |
|
asymptotic algorithm |
1 |
|
asynchronous complete networks |
1 |
|
atomic transactions database availability network partitioning nonblocking commit protocols nontrivial termination recovery strategies site failures |
1 |
|
auditing |
1 |
|
autonomous system (as) |
1 |
|
bridges |
1 |
|
broadcast scheduling |
1 |
|
buffer management |
1 |
|
cache replacement |
1 |
|
cellular networks |
1 |
|
channel assignment |
1 |
|
clique |
1 |
|
coherence |
1 |
|
combinatorial problems |
1 |
|
communications |
1 |
|
compromisability |
1 |
|
computer architecture |
1 |
|
computers |
1 |
|
conceptual databases model |
1 |
|
conceptual models |
1 |
|
constrained delaunay triangulation |
1 |
|
constrained longest common subsequence |
1 |
|
container loading |
1 |
|
convex 3-polytopes |
1 |
|
convex polygonal curves |
1 |
|
convex polygons |
1 |
|
convolution kernels |
1 |
|
curve fitting |
1 |
|
data security |
1 |
|
database design |
1 |
|
density thresholds |
1 |
|
design |
1 |
|
disjoint convex polygon |
1 |
|
distributed election |
1 |
|
distributed election algorithms |
1 |
|
embedding |
1 |
|
embeddings |
1 |
|
error evaluation |
1 |
|
expansion |
1 |
|
expected message complexity |
1 |
|
fast filter transforms |
1 |
|
feasible timetable |
1 |
|
flow time minimization |
1 |
|
flow-shop schedules |
1 |
|
frequency allocation |
1 |
|
full binary trees |
1 |
|
graph problems |
1 |
|
gray codes |
1 |
|
greedy algorithm |
1 |
|
haplotype inference |
1 |
|
heuristic |
1 |
|
heuristic algorithm |
1 |
|
heuristic schedules |
1 |
|
hexagonal graphs |
1 |
|
hyper cubes |
1 |
|
hypercubes |
1 |
|
image pyramids |
1 |
|
importance ratio |
1 |
|
index codebook |
1 |
|
index terms— |
1 |
|
inference control |
1 |
|
internet |
1 |
|
job schedulmg |
1 |
|
jobs scheduling |
1 |
|
kendall-τ distance |
1 |
|
locality |
1 |
|
longest common subsequence |
1 |
|
map labeling |
1 |
|
matrix chain product |
1 |
|
matrix multiplication |
1 |
|
maximum weight triangulation |
1 |
|
mean square error |
1 |
|
minimum error |
1 |
|
minimum fimshmg time |
1 |
|
minimum manhattan network |
1 |
|
minimum manhattan networks |
1 |
|
minimum triangulation |
1 |
|
minimum vertex distance |
1 |
|
mobile network |
1 |
|
monotonicity |
1 |
|
multicoloring |
1 |
|
multimedia |
1 |
|
multimedia object caching |
1 |
|
nearest neighbors |
1 |
|
network connections |
1 |
|
np-completeness |
1 |
|
number of line segments |
1 |
|
object placement |
1 |
|
object placement (replacement) |
1 |
|
on-line algorithm |
1 |
|
online algorithm |
1 |
|
online scheduling |
1 |
|
optimization |
1 |
|
optional schedules |
1 |
|
parallel algorithms |
1 |
|
parallel computation |
1 |
|
partial encoding |
1 |
|
partial job values |
1 |
|
pedigree |
1 |
|
performance analysis |
1 |
|
performance evaluation |
1 |
|
polygon |
1 |
|
polygon distances |
1 |
|
polygon intersection |
1 |
|
polygonal approximation |
1 |
|
polynomial approximation |
1 |
|
processor failures and recoveries |
1 |
|
protection |
1 |
|
quality of service |
1 |
|
question answering system |
1 |
|
rank aggregation |
1 |
|
recombination |
1 |
|
resource augmentation |
1 |
|
scan algorithms |
1 |
|
security |
1 |
|
security kernel |
1 |
|
sequential techniques |
1 |
|
simd |
1 |
|
simulated annealing |
1 |
|
simulation |
1 |
|
spline curves |
1 |
|
stabber |
1 |
|
statistical database |
1 |
|
statistical databases |
1 |
|
synchronous complete networks |
1 |
|
theory |
1 |
|
three-layer encoding |
1 |
|
timesharing |
1 |
|
timetabling |
1 |
|
transparent data access |
1 |
|
transversal |
1 |
|
tree network |
1 |
|
unidirectional rings |
1 |
|
unimodality |
1 |
|
vector quantization |
1 |
|
verification |
1 |
|
voronoi diagram |
1 |
|
web caching |
1 |
|
weighted ecc |
1 |
