2,086 results on '"Zelikovsky A"'
Search Results
202. Mobile Fleet Application using Soap and System on Devices (SYD) Middleware Technologies.
203. Auctions with Buyer Preferences.
204. Border Length Minimization in DNA Array Design.
205. Symmetric Connectivity with Minimum Power Consumption in Radio Networks
206. Auctions with Buyer Preferences
207. Border Length Minimization in DNA Array Design*
208. Classification of HCV infections through sequence image normalization.
209. Assessment of HCV infection stage as recent or chronic using multi-parameter analysis and machine learning.
210. Efficient filtering algorithm for detection of genetic similarity between large genomic datasets.
211. CAME 2017: 6th Workshop on Computational Advances in Molecular Epidemiology.
212. Selecting forwarding neighbors in wireless Ad Hoc networks.
213. Provably good global buffering by multi-terminal multicommodity flow approximation.
214. Hierarchical dummy fill for process uniformity.
215. New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout.
216. Practical Approximation Algorithms for Separable Packing Linear Programs.
217. Practical approximation algorithms for zero- and bounded-skew trees.
218. Practical Approximation Algorithms for Separable Packing Linear Programs
219. 17th International Symposium on Bioinformatics Research and Applications (ISBRA 2021)
220. Unlocking capacities of genomics for the COVID-19 response and future pandemics
221. Clustering SARS-CoV-2 Variants from Raw High-Throughput Sequencing Reads Data
222. Provably Good Global Buffering Using an Available Buffer Block Plan.
223. Monte-Carlo algorithms for layout density control.
224. Improved Steiner tree approximation in graphs.
225. Practical iterated fill synthesis for CMP uniformity.
226. On Approximation of the Power-p and Bottleneck Steiner Trees
227. Guest Editors' Introduction to the Special Section on Bioinformatics Research and Applications
228. Bottleneck steiner tree problems Bottleneck Steiner Tree Problems : BSTP Bottleneck Steiner tree problems BSTP
229. Optimal phase conflict removal for layout of dark field alternating phase shifting masks.
230. The associative-skew clock routing problem.
231. New and Exact Filling Algorithms for Layout Density Control.
232. New Multilevel and Hierarchical Algorithms for Layout Density Control.
233. Optimization of Linear Placements for Wirelength Minimization with Free Sites.
234. The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout.
235. The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
236. The relationships between acculturation and complementary and alternative medicine beliefs and use among Asian Americans.
237. Reconstruction of Infectious Bronchitis Virus Quasispecies from NGS Data
238. Pooling Strategy for Massive Viral Sequencing
239. Transcriptome Quantification and Differential Expression from NGS Data
240. Applications of High-Fidelity Sequencing Protocol to RNA Viruses
241. Scaffolding Algorithms
242. Error Correction of NGS Reads from Viral Populations
243. HapIso: An Accurate Method for the Haplotype-Specific Isoforms Reconstruction from Long Single-Molecule Reads
244. Profiling immunoglobulin repertoires across multiple human tissues using RNA sequencing
245. ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching.
246. ScaffMatch: Scaffolding Algorithm Based on Maximum Weight Matching
247. Benchmarking Machine Learning Robustness in Covid-19 Genome Sequence Classification
248. Filling and slotting: analysis and algorithms.
249. On wirelength estimations for row-based placement.
250. Moving-Target TSP and Related Problems.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.