Search results for "SNP"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
12	Bin Ma 0002, Kaizhong Zhang	On the Longest Common Rigid Subsequence Problem.	CPM	2005	DBLP DOI BibTeX RDF
12	Virginia Vassilevska	Explicit Inapproximability Bounds for the Shortest Superstring Problem.	MFCS	2005	DBLP DOI BibTeX RDF
12	Jiho Chang, JongSu Yi, JunSeong Kim	A Switch Wrapper Design for SNA On-Chip-Network.	Asia-Pacific Computer Systems Architecture Conference	2005	DBLP DOI BibTeX RDF
12	Camille Bodley Troup, Bill Martin, Carl E. McMillin, Robert M. Horton	Simulated Pharmacogenomics Exercises for the Cybertory Virtual Molecular Biology Laboratory.	CSB Workshops	2005	DBLP DOI BibTeX RDF
12	Md. Khayrul Bashar, Noboru Ohnishi, Kiyoshi Agusa	Local Feature Saliency for Texture Representation.	ICAPR (2)	2005	DBLP DOI BibTeX RDF	feature saliency, binary domain texture features, segmentation, wavelet transform, Texture
12	Xia Li 0004, Shaoqi Rao, Wei Zhang, Zheng Guo 0002, Wei Jiang 0023, Lei Du	Large-Scale Ensemble Decision Analysis of Sib-Pair IBD Profiles for Identification of the Relevant Molecular Signatures for Alcoholism.	FSKD (2)	2005	DBLP DOI BibTeX RDF
12	Bing-Hong Liu, Ming-Jer Tsai, Wei-Chei Ko	Dynamical Construction of a Core-Based Group-Shared Multicast Tree in Mobile Ad Hoc Networks.	AINA	2005	DBLP DOI BibTeX RDF
12	Thomas Lewiner, Hélio Lopes 0001, Geovan Tavares	Applications of Forman's Discrete Morse Theory to Topology Visualization and Mesh Compression.	IEEE Trans. Vis. Comput. Graph.	2004	DBLP DOI BibTeX RDF
12	Jing Li 0002, Tao Jiang 0001	An exact solution for finding minimum recombinant haplotype configurations on pedigrees with missing data by integer linear programming.	RECOMB	2004	DBLP DOI BibTeX RDF	missing data imputation, pedigree analysis, integer linear programming, branch-and-bound algorithm, recombination, haplotyping
12	Jorng-Tzong Horng, Kai-Chih Hu, Li-Cheng Wu, Hsien-Da Huang, Horn-Cheng Lai, Ton-Yuen Chu	Identifying the Combination of Genetic Factors that Determine Susceptibility to Cervical Cancer.	BIBE	2004	DBLP DOI BibTeX RDF	Genetic Factors, Cervical Cancer, Bayesian Network, Decision tree
12	Tamar Barzuza, Jacques S. Beckmann, Ron Shamir, Itsik Pe'er	Computational Problems in Perfect Phylogeny Haplotyping: Xor-Genotypes and Tag SNPs.	CPM	2004	DBLP DOI BibTeX RDF
12	Eugene Lin, Dennis Chen, Yuchi Hwang, Ashely Chang, Z. John Gu	A Prediction Model for the Drug Efficacy of Interferon in CHC Patients Based on SNPs.	CSB	2004	DBLP DOI BibTeX RDF
12	Julia Chuzhoy, Joseph Naor	New hardness results for congestion minimization and machine scheduling.	STOC	2004	DBLP DOI BibTeX RDF	routing, approximation algorithms, hardness of approximation, machine scheduling, congestion minimization
12	Noga Alon, Assaf Naor	Approximating the cut-norm via Grothendieck's inequality.	STOC	2004	DBLP DOI BibTeX RDF	Grothendieck's inequaity, cut-norm, rounding techniques
12	Alexey Baburin, Edward Gimadi	Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees.	OR	2004	DBLP DOI BibTeX RDF
12	Holger Schwender	Modifying Microarray Analysis Methods for Categorical Data - SAM and PAM for SNPs.	GfKl	2004	DBLP DOI BibTeX RDF
12	Jianer Chen, Benny Chor, Mike Fellows, Xiuzhen Huang, David W. Juedes, Iyad A. Kanj, Ge Xia	Tight Lower Bounds for Certain Parameterized NP-Hard Problems.	CCC	2004	DBLP DOI BibTeX RDF
12	Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo	Improving table compression with combinatorial optimization.	J. ACM	2003	DBLP DOI BibTeX RDF	table compression, dynamic programming, experimental algorithmics, Asymmetric traveling salesman problem
12	Thomas Erlebach, Stamatis Stefanakos	Wavelength Conversion in Shortest-Path All-Optical Networks.	ISAAC	2003	DBLP DOI BibTeX RDF
12	Kui Zhang, Fengzhu Sun, Michael S. Waterman, Ting Chen 0006	Dynamic programming algorithms for haplotype block partitioning: applications to human chromosome 21 haplotype data.	RECOMB	2003	DBLP DOI BibTeX RDF	local maximal haplotypes, tag SNPs, clustering, dynamic programming, haplotype block
12	Gideon Greenspan, Dan Geiger	Model-based inference of haplotype block variation.	RECOMB	2003	DBLP DOI BibTeX RDF	haplotype resolution, linkage disequilibrium mapping, recombination hotspot, Bayesian Network, haplotype, haplotype block
12	Will Casey, Bud Mishra	A Nearly Linear-Time General Algorithm for Genome-Wide Bi-allele Haplotype Phasing.	HiPC	2003	DBLP DOI BibTeX RDF
12	Zhi-Zhong Chen, Tao Jiang 0001, Guohui Lin, Romeo Rizzi, Jianjun Wen, Dong Xu 0002, Ying Xu 0001	More Reliable Protein NMR Peak Assignment via Improved 2-Interval Scheduling.	ESA	2003	DBLP DOI BibTeX RDF
12	Jianer Chen, Iyad A. Kanj, Ljubomir Perkovic, Eric Sedgwick, Ge Xia	Genus Characterizes the Complexity of Graph Problems: Some Tight Results.	ICALP	2003	DBLP DOI BibTeX RDF
12	Fang-Rong Hsu, J. F. Chen	Aligning ESTs to Genome Using Multi-Layer Unique Makers.	CSB	2003	DBLP DOI BibTeX RDF
12	Hadas Shachnai, Tami Tamir	Approximation Schemes for Generalized 2-Dimensional Vector Packing with Application to Data Placement.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
12	Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, Nan Wang 0001	Approximation Algorithms for Channel Allocation Problems in Broadcast Networks.	RANDOM-APPROX	2003	DBLP DOI BibTeX RDF
12	René Sitters	The Minimum Latency Problem Is NP-Hard for Weighted Trees.	IPCO	2002	DBLP DOI BibTeX RDF
12	Béla Csaba, Marek Karpinski, Piotr Krysta	Approximability of dense and sparse instances of minimum 2-connectivity, TSP and path problems.	SODA	2002	DBLP BibTeX RDF
12	Sudipto Guha, Kamesh Munagala	Improved algorithms for the data placement problem.	SODA	2002	DBLP BibTeX RDF
12	Adam L. Buchsbaum, Glenn S. Fowler, Raffaele Giancarlo	Improving table compression with combinatorial optimization.	SODA	2002	DBLP BibTeX RDF
12	Vamsi Veeramachaneni, Piotr Berman, Webb Miller	Aligning Two Fragmented Sequences.	IPDPS	2002	DBLP DOI BibTeX RDF
12	Masazumi Takahashi, Fumihiko Matsuda, Nino Margetic, Mark G. Lathrop	Automated Identification of Single Nucleotide Polymorphisms from Sequencing Data.	CSB	2002	DBLP DOI BibTeX RDF
12	Marilyn Safran, Irina Solomon, Orit Shmueli, Michal Lapidot, Shai Shen-Orr, Avital Adato, Uri Ben-Dor, Nir Esterman, Naomi Rosen, Inga Peter, Tsviya Olender, Vered Chalifa-Caspi, Doron Lancet	GeneCards? 2002: An Evolving Human Gene Compendium.	CSB	2002	DBLP DOI BibTeX RDF
12	Esko Ukkonen	Finding Founder Sequences from a Set of Recombinants.	WABI	2002	DBLP DOI BibTeX RDF
12	Zhi-Zhong Chen, Tao Jiang 0001, Guo-Hui Lin, Jianjun Wen, Dong Xu 0002, Ying Xu 0001	Improved Approximation Algorithms for NMR Spectral Peak Assignment.	WABI	2002	DBLP DOI BibTeX RDF
12	Chin Lung Lu, Chuan Yi Tang, Richard Chia-Tung Lee	The Full Steiner Tree Problem in Phylogeny.	COCOON	2002	DBLP DOI BibTeX RDF
12	Liming Cai, David W. Juedes	Subexponential Parameterized Algorithms Collapse the W-Hierarchy.	ICALP	2001	DBLP DOI BibTeX RDF
12	Chandra Chekuri, Sanjeev Khanna	A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines.	ICALP	2001	DBLP DOI BibTeX RDF	average completion time, uniformly related machines, weighted completion time, scheduling, Polynomial time approximation scheme
12	Zhuozhi Wang, Kaizhong Zhang	Alignment between Two RNA Structures.	MFCS	2001	DBLP DOI BibTeX RDF
12	Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton	On the Complexity of Join Predicates. (PDF / PS)	PODS	2001	DBLP DOI BibTeX RDF
12	Piotr Krysta, V. S. Anil Kumar 0001	Approximation Algorithms for Minimum Size 2-Connectivity Problems.	STACS	2001	DBLP DOI BibTeX RDF
12	Luca Trevisan	Non-approximability results for optimization problems on bounded degree instances.	STOC	2001	DBLP DOI BibTeX RDF
12	Mitsuo Motoki	Random Instance Generation for MAX 3SAT.	COCOON	2001	DBLP DOI BibTeX RDF
12	V. S. Anil Kumar 0001, Sunil Arya, H. Ramesh	Hardness of Set Cover with Intersection 1.	ICALP	2000	DBLP DOI BibTeX RDF
12	Piotr Berman, Junichiro Fukuyama	Variable length sequencing with two lengths.	APPROX	2000	DBLP DOI BibTeX RDF
12	Alan M. Frieze, Ravi Kannan	Quick Approximation to Matrices and Applications.	Comb.	1999	DBLP DOI BibTeX RDF	AMS Subject Classification (1991) Classes: 68Q25, 68R05
12	William H. Cunningham, Lawrence Tang	Optimal 3-Terminal Cuts and Linear Programming.	IPCO	1999	DBLP DOI BibTeX RDF
12	Hiroki Arimura, Shinichi Shimozono	Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words.	ISAAC	1998	DBLP DOI BibTeX RDF
12	Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger	Non-approximability Results for Scheduling Problems with Minsum Criteria.	IPCO	1998	DBLP DOI BibTeX RDF
12	Venkatesan Guruswami, C. Pandu Rangan, Maw-Shang Chang, Gerard J. Chang, C. K. Wong	The Vertex-Disjoint Triangles Problem.	WG	1998	DBLP DOI BibTeX RDF
12	Peter Damaschke	Minus Domination in Small-Degree Graphs.	WG	1998	DBLP DOI BibTeX RDF
12	Dorit S. Hochbaum	Instant Recognition of Half Integrality and 2-Approximations.	APPROX	1998	DBLP DOI BibTeX RDF
12	Hsueh-I Lu, R. Ravi 0001	A Fast Approximation Algorithm for Maximum-Leaf Spanning Tree.	ISPAN	1997	DBLP DOI BibTeX RDF	Maximum-leaf spanning tree, Approximation algorithms, Performance guarantee, Approximation ratio
12	Hartmut Klauck	On the Hardness of Global and Local Approximation.	SWAT	1996	DBLP DOI BibTeX RDF
12	Anders Malmström	Optimization Problems with Approximation Schemes.	CSL	1996	DBLP DOI BibTeX RDF
12	Shinichi Shimozono	An Approximation Algorithm for Alphabet Indexing Problem.	ISAAC	1995	DBLP DOI BibTeX RDF
12	Benny Chor, Madhu Sudan 0001	A Geometric Approach to Betweenness.	ESA	1995	DBLP DOI BibTeX RDF
12	Manuel Blum 0001, Bruno Codenotti, Peter Gemmell, Troy Shahoumian	Self-Correcting for Function Fields Transcendental Degree.	ICALP	1995	DBLP DOI BibTeX RDF
12	Viggo Kann	On the Approximability of the Maximum Common Subgraph Problem.	STACS	1992	DBLP DOI BibTeX RDF	computational complexity, Approximation, graph problems
12	Edmund Ihler	The Complexity of Approximating the Class Steiner Tree Problem.	WG	1991	DBLP DOI BibTeX RDF