Search results for "Deletions"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
65	Joaquim Gabarró, Xavier Messeguer, Daniel Riu	Concurrent Rebalancing on HyperRed-Black Trees.	SCCC	1997	DBLP DOI BibTeX RDF	concurrent rebalancing, HyperRed-Black trees, consecutive red nodes, Chromatic trees, red nodes, concurrent deletions algorithm, concurrent insertions, direct updating, red cluster, trees (mathematics), deletions
64	Gonzalo Navarro 0001, Nora Reyes	Improved Deletions in Dynamic Spatial Approximation Trees.	SCCC	2003	DBLP DOI BibTeX RDF
47	Rainer Gemulla, Wolfgang Lehner, Peter J. Haas	Maintaining bounded-size sample synopses of evolving datasets.	VLDB J.	2008	DBLP DOI BibTeX RDF	Database sampling, Reservoir sampling, Sample maintenance, Synopsis
45	Pinar Heggernes, Charis Papadopoulos	Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions.	COCOON	2007	DBLP DOI BibTeX RDF
45	Mark Marron, Krister M. Swenson, Bernard M. E. Moret	Genomic Distances under Deletions and Insertions.	COCOON	2003	DBLP DOI BibTeX RDF	inversion distance, reversal distance, genomic distance, Hannenhalli-Pevzner
45	Haim Kaplan, Nira Shafrir, Robert Endre Tarjan	Union-find with deletions.	SODA	2002	DBLP BibTeX RDF
45	Lucas Chi Kwong Hui, Charles U. Martel	Analysing Deletions in Competitive Self-Adjusting Linear List.	ISAAC	1994	DBLP DOI BibTeX RDF
42	Abdoulaye Baniré Diallo, Vladimir Makarenkov, Mathieu Blanchette	Finding Maximum Likelihood Indel Scenarios.	Comparative Genomics	2006	DBLP DOI BibTeX RDF	Ancestral genome reconstruction, Insertions and deletions, Tree-HMM, Ancestral mammalian genomes
42	Paolo Ferragina	An EREW PRAM fully-dynamic algorithm for MST.	IPPS	1995	DBLP DOI BibTeX RDF	EREW PRAM fully-dynamic algorithm, undirected weighted graph, single edge insertions, single edge deletions, sparsification data structure, parallel algorithms, parallel algorithm, computational complexity, time, trees (mathematics), minimum spanning tree, tree data structures, nodes, work
37	Vladimir Braverman, Rafail Ostrovsky, Carlo Zaniolo	Optimal sampling from sliding windows.	PODS	2009	DBLP DOI BibTeX RDF	data streams, random sampling, sliding windows
37	Thomas P. Hayes, Jared Saia, Amitabh Trehan	The forgiving graph: a distributed data structure for low stretch under adversarial attack.	PODC	2009	DBLP DOI BibTeX RDF	half-full tree, peer-to-peer, network, data structure, distributed, reconfigurable, self-healing, responsive, stretch, degree
37	Pankaj K. Agarwal, Haim Kaplan, Micha Sharir	Kinetic and dynamic data structures for closest pair and all nearest neighbors.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	computational geometry, nearest neighbors, Kinetic data structures, closest pair
37	Jun Hu, Tolga M. Duman, Mehmet Fatih Erden	On the Information Rates of Channels with Insertion/Deletion/Substitution Errors.	ICC	2008	DBLP DOI BibTeX RDF
37	David L. Heine, Monica S. Lam	Static detection of leaks in polymorphic containers.	ICSE	2006	DBLP DOI BibTeX RDF	program analysis, type systems, memory management, error detection, memory leaks
37	Samer Nassar, Jörg Sander 0001, Corrine Cheng	Incremental and Effective Data Summarization for Dynamic Hierarchical Clustering. (PDF / PS)	SIGMOD Conference	2004	DBLP DOI BibTeX RDF	incremental data bubbles, clustering, data summarization
37	Jovan Dj. Golic, Luke O'Connor	Embedding and Probabilistic Correlation Attacks on Clock-Controlled Shift Registers.	EUROCRYPT	1994	DBLP DOI BibTeX RDF
36	Richard Cole 0001, Alan M. Frieze, Bruce M. Maggs, Michael Mitzenmacher, Andréa W. Richa, Ramesh K. Sitaraman, Eli Upfal	On Balls and Bins with Deletions.	RANDOM	1998	DBLP DOI BibTeX RDF
35	Caroline Brosse	Efficient enumeration algorithms for minimal graph completions and deletions. (Algorithmes d'énumération efficaces pour les complétions et délétions minimales de graphes).		2023	RDF
35	Benedetta Bigio	Assessment of Hardy-Weinberg equilibrium and detection of chromosomal deletions in exome-wide sequencing data from large datasets: exploiting large exome datasets to improve identification of clinically relevant genetic variants. (Intérêt de l'équilibre de Hardy-Weinberg et détection des délétions chromosomiques dans les données de séquençage d'exome à partir de grands ensembles de données).		2020	RDF
33	Raheleh Salari, Alexander Schönhuth, Fereydoun Hormozdiari, Artem Cherkasov, Süleyman Cenk Sahinalp	The Relation between Indel Length and Functional Divergence: A Formal Study.	WABI	2008	DBLP DOI BibTeX RDF	Alignment statistics, Pair Hidden Markov Models, Insertions, Deletions, GO
33	Luc Bougé, Joaquim Gabarró, Xavier Messeguer, Nicolas Schabanel	Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract).	Euro-Par	1997	DBLP DOI BibTeX RDF	Concurrent insertions and deletions, Concurrent generalized rotations, Safety and liveness proofs, Search trees, AVL trees, Concurrent algorithms
33	Hendrik Decker	Abduction for Knowledge Assimilation in Deductive Databases.	SCCC	1997	DBLP DOI BibTeX RDF	integrity maintenance, knowledge assimilation, SLDAI, SLD-based proof procedure, update request, hypothetical fact insertions, hypothetical fact deletions, base predicates, abductive logic programming, deductive databases, deductive databases, abduction
33	Elena Barcucci, Renzo Pinzani, Renzo Sprugnoli	Optimal Selection of Secondary Indexes.	IEEE Trans. Software Eng.	1990	DBLP DOI BibTeX RDF	optimal selection, secondary indexes, cost function properties, database, indexing, database management systems, queries, transaction processing, heuristic algorithm, updates, polynomial time, heuristic programming, insertions, deletions, transaction model
28	Siddhartha Sen 0001, Robert Endre Tarjan	Deletion without Rebalancing in Multiway Search Trees.	ISAAC	2009	DBLP DOI BibTeX RDF
28	Mathias Weller, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann	On Making Directed Graphs Transitive.	WADS	2009	DBLP DOI BibTeX RDF
28	Danny Z. Chen, Ewa Misiolek	Free-Form Surface Partition in 3-D.	ISAAC	2008	DBLP DOI BibTeX RDF
28	Ruijie Guo, Xueqi Cheng, Hongbo Xu, Bin Wang 0004	Efficient on-line index maintenance for dynamic text collections by using dynamic balancing tree.	CIKM	2007	DBLP DOI BibTeX RDF	dynamic text collections, index maintenance, on-line index, information retrieval, garbage collection
28	Erik Corona, Benjamin J. Raphael, Eleazar Eskin	Identification of Deletion Polymorphisms from Haplotypes.	RECOMB	2007	DBLP DOI BibTeX RDF
28	Graham Cormode, S. Muthukrishnan 0001	What's hot and what's not: tracking most frequent items dynamically.	ACM Trans. Database Syst.	2005	DBLP DOI BibTeX RDF	approximate query answering, Data stream processing
28	Graham Cormode, S. Muthukrishnan 0001	What's hot and what's not: tracking most frequent items dynamically.	PODS	2003	DBLP DOI BibTeX RDF
28	Guozhu Dong, Jianwen Su	Incremental Maintenance of Recursive Views Using Relational Calculus/SQL.	SIGMOD Rec.	2000	DBLP DOI BibTeX RDF	SQL
28	Daniele Frigioni, Tobias Miller, Umberto Nanni, Giulio Pasqualone, Guido Schäfer, Christos D. Zaroliagis	An Experimental Study of Dynamic Algorithms for Directed Graphs.	ESA	1998	DBLP DOI BibTeX RDF
28	Kurt Mehlhorn	A New Data Structure for Representing Sorted Lists.	WG	1980	DBLP DOI BibTeX RDF
27	Tetsuo Shibuya, Jesper Jansson 0001, Kunihiko Sadakane	Linear-Time Protein 3-D Structure Searching with Insertions and Deletions.	WABI	2009	DBLP DOI BibTeX RDF
27	Crystal L. Kahn, Shay Mozes, Benjamin J. Raphael	Efficient Algorithms for Analyzing Segmental Duplications, Deletions, and Inversions in Genomes.	WABI	2009	DBLP DOI BibTeX RDF
27	Ping Wu, Divyakant Agrawal, Ömer Egecioglu, Amr El Abbadi	DeltaSky: Optimal Maintenance of Skyline Deletions without Exclusive Dominance Region Generation.	ICDE	2007	DBLP DOI BibTeX RDF
27	Nadia El-Mabrouk	Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments.	CPM	2000	DBLP DOI BibTeX RDF
27	Chaoyi Pang, Kotagiri Ramamohanarao, Guozhu Dong	Incremental FO(+, <) Maintenance of All-Pairs Shortest Paths for Undirected Graphs after Insertions and Deletions.	ICDT	1999	DBLP DOI BibTeX RDF
27	Mark Daley, Lila Kari, Greg Gloor, Rani Siromoney	Circular Contextual Insertions/Deletions with Applications to Biomolecular Computation.	SPIRE/CRIWG	1999	DBLP DOI BibTeX RDF
23	Michael A. Bender, Erik D. Demaine, Martin Farach-Colton	Cache-Oblivious B-Trees.	FOCS	2000	DBLP DOI BibTeX RDF	cache-oblivious B-trees, dynamic search-tree data structures, optimal search bound, amortized memory transfers, computational complexity, memory hierarchy, cache storage, tree data structures, insertions, deletions, tree searching, hierarchical memory, worst-case bounds
23	Dominique Laurent 0001, Nicolas Spyratos	A Partition Model Approach to Updating Universal Scheme Interfaces.	IEEE Trans. Knowl. Data Eng.	1994	DBLP DOI BibTeX RDF	partition model, universal scheme interface updating, relational database updating, counterintuitive results, partition semantics, relational databases, database theory, relational algebra, functional dependency, nondeterminism, relational model, deletions, universal relation
23	Sunil Arya, David M. Mount, Michiel H. M. Smid	Randomized and deterministic algorithms for geometric spanners of small diameter	FOCS	1994	DBLP DOI BibTeX RDF	randomized algorithms, directed graph, deterministic algorithms, insertions, deletions, geometric spanners
23	Keh-Chang Guh, Clement T. Yu	Efficient Management of Materialized Generalized Transitive Closure in Centralized and Parallel Environments.	IEEE Trans. Knowl. Data Eng.	1992	DBLP DOI BibTeX RDF	centralised environments, materialized generalized transitive closure, computational complexity, parallel processing, data structure, data structures, expert systems, queries, time complexities, deductive databases, insertions, deletions, parallel environments, multiprocessor environment
23	Monika Rauch	Fully Dynamic Biconnectivity in Graphs	FOCS	1992	DBLP DOI BibTeX RDF	query time, dynamic biconnectivity, edge insertions, linear storage, amortized running time, planar embedded graph, graphs, time complexity, deletions
23	Frank Thomson Leighton, Eric J. Schwabe	Efficient Algorithms for Dynamic Allocation of Distributed Memory	FOCS	1991	DBLP DOI BibTeX RDF	local memory resources, online allocation algorithm, near-optimal fashion, service delays, algorithms, parallel system, distributed memory, insertions, deletions, dynamic allocation
23	Otfried Schwarzkopf	Dynamic Maintenance of Geometric Structures Made Easy	FOCS	1991	DBLP DOI BibTeX RDF	dynamic maintenance, Voronoi diagrams, convex hulls, insertions, deletions, geometric structures, randomized incremental algorithms, planar subdivisions, backwards analysis
23	William I. Chang, Eugene L. Lawler	Approximate String Matching in Sublinear Expected Time	FOCS	1990	DBLP DOI BibTeX RDF	random string, infrequent errors, sublinear expected time, pattern string, substring matching, dynamic programming, efficient algorithms, genetics, insertions, approximate string matching, deletions, substitutions, differences, molecular biology, text string
19	Sanchit Misra, Ramanathan Narayanan, Simon Lin, Alok N. Choudhary	FANGS: high speed sequence mapping for next generation sequencers.	SAC	2010	DBLP DOI BibTeX RDF	454 sequencers, next generation sequencers, sequence mapping
19	Serge Abiteboul, Pierre Bourhis, Bogdan Marinoiu	Satisfiability and relevance for queries over active documents.	PODS	2009	DBLP DOI BibTeX RDF	active XML, query satisfiability, relevance
19	Kamesh Madduri, David A. Bader	Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis.	IPDPS	2009	DBLP DOI BibTeX RDF
19	Byron Choi, Gao Cong, Wenfei Fan, Stratis Viglas	Updating Recursive XML Views of Relations.	J. Comput. Sci. Technol.	2008	DBLP DOI BibTeX RDF	XML, view update, XML views, XML publishing
19	Krister M. Swenson, Mark Marron, Joel V. Earnest-DeYoung, Bernard M. E. Moret	Approximating the true evolutionary distance between two genomes.	ACM J. Exp. Algorithmics	2008	DBLP DOI BibTeX RDF	pairwise distances, whole-genome data, Evolution, inversions, duplications
19	Michael M. Zavlanos, George J. Pappas	Distributed Connectivity Control of Mobile Networks.	IEEE Trans. Robotics	2008	DBLP DOI BibTeX RDF
19	Marcin Imielinski, Niels Klitgord, Calin Belta	Investigating the genomic basis of metabolic robustness through in silico flux analysis.	CDC	2008	DBLP DOI BibTeX RDF
19	Stanko Dimitrov, Parameshwaran Krishnan, Colin L. Mallows, Jean Meloche, Shalini Yajnik	r3: Resilient Random Regular Graphs.	DISC	2008	DBLP DOI BibTeX RDF
19	Valeria Fionda, Luigi Palopoli 0001, Simona Panni, Simona E. Rombo	Protein-Protein Interaction Network Querying by a "Focus and Zoom" Approach.	BIRD	2008	DBLP DOI BibTeX RDF
19	Ismel Brito, Pedro Meseguer	Connecting ABT with Arc Consistency.	CP	2008	DBLP DOI BibTeX RDF
19	Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier	Fixed-Parameter Algorithms for Cluster Vertex Deletion.	LATIN	2008	DBLP DOI BibTeX RDF
19	Luke McAven, Reihaneh Safavi-Naini	Classification of the Deletion Correcting Capabilities of Reed-Solomon Codes of Dimension 2 Over Prime Fields.	IEEE Trans. Inf. Theory	2007	DBLP DOI BibTeX RDF
19	John J. Metzner	Packet-Symbol Decoding for Reliable Multipath Reception with No Sequence Numbers.	ICC	2007	DBLP DOI BibTeX RDF
19	Stratos Idreos, Martin L. Kersten, Stefan Manegold	Updating a cracked database.	SIGMOD Conference	2007	DBLP DOI BibTeX RDF	database cracking, self-organization, updates
19	Rainer Gemulla, Wolfgang Lehner, Peter J. Haas	Maintaining bernoulli samples over evolving multisets.	PODS	2007	DBLP DOI BibTeX RDF	Bernoulli multiset sampling, incremental sample maintenance
19	Marc Tedder, Derek G. Corneil	An Optimal, Edges-Only Fully Dynamic Algorithm for Distance-Hereditary Graphs.	STACS	2007	DBLP DOI BibTeX RDF	graph recognition, distance-hereditary, dynamic algorithm, cograph
19	Slobodan Petrovic, Amparo Fúster-Sabater	Reconstruction of Suboptimal Paths in the Constrained Edit Distance Array with Application in Cryptanalysis.	ICCSA (3)	2007	DBLP DOI BibTeX RDF	Constrained Edit distance, Dynamic Programming, Cryptanalysis, Directed Search, String Editing
19	Miguel Rocha 0001, Rui Mendes 0001, Paulo Maia, José P. Pinto, Isabel Rocha, Eugénio C. Ferreira	Evaluating Simulated Annealing Algorithms in the Optimization of Bacterial Strains.	EPIA Workshops	2007	DBLP DOI BibTeX RDF	Set based representations, Variable size chromosomes, Metabolic Engineering, Simulated Annealing, Flux-Balance Analysis
19	Axel Mosig, Julian J.-L. Chen, Peter F. Stadler	Homology Search with Fragmented Nucleic Acid Sequence Patterns.	WABI	2007	DBLP DOI BibTeX RDF
19	Jiakui Zhao, Dongqing Yang, Lijun Chen 0002, Jun Gao 0003, Tengjiao Wang 0003	Cardinality Computing: A New Step Towards Fully Representing Multi-sets by Bloom Filters.	WISE	2006	DBLP DOI BibTeX RDF
19	Timothy M. Chan	A dynamic data structure for 3-d convex hulls and 2-d nearest neighbor queries.	SODA	2006	DBLP DOI BibTeX RDF
19	Prasad Vinod, Suri Pushpa, Carsten Maple	Maintaining a Random Binary Search Tree Dynamically.	IV	2006	DBLP DOI BibTeX RDF
19	Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos	A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs.	WG	2006	DBLP DOI BibTeX RDF	fully dynamic algorithms, P4-sparse graphs, recognition, modular decomposition
19	Hassan Masoom, Suprakash Datta, Amir Asif, Lesley Cunningham, Gillian Wu	A Fast Algorithm for Detecting Frame Shifts in DNA sequences.	CIBCB	2006	DBLP DOI BibTeX RDF
19	Vijaya Smitha Kolli, Hui Liu 0008, Jieyue He, Michelle Hong Pan, Yi Pan 0001	Calculating Genomic Distances in Parallel Using OpenMP.	Trans. Comp. Sys. Biology	2005	DBLP DOI BibTeX RDF
19	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Graph-Modeled Data Clustering: Exact Algorithms for Clique Generation.	Theory Comput. Syst.	2005	DBLP DOI BibTeX RDF
19	Ranjith Purushothaman, Dewayne E. Perry	Toward Understanding the Rhetoric of Small Source Code Changes.	IEEE Trans. Software Eng.	2005	DBLP DOI BibTeX RDF	Source code changes, one-line changes, fault probabilities, software faults
19	Stefan Büttcher, Charles L. A. Clarke	Indexing time vs. query time: trade-offs in dynamic information retrieval systems.	CIKM	2005	DBLP DOI BibTeX RDF
19	Elke Achtert, Christian Böhm 0001, Hans-Peter Kriegel, Peer Kröger	Online Hierarchical Clustering in a Data Warehouse Environment.	ICDM	2005	DBLP DOI BibTeX RDF
19	Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara	New Bit-Parallel Indel-Distance Algorithm.	WEA	2005	DBLP DOI BibTeX RDF
19	Vijaya Smitha Kolli, Hui Liu 0008, Michelle Hong Pan, Yi Pan 0001	A Parallel Implementation for Determining Genomic Distances Under Deletion and Insertion.	International Conference on Computational Science (2)	2005	DBLP DOI BibTeX RDF
19	Spyros Sioutas, Yannis Panagis, Evangelos Theodoridis, Athanasios K. Tsakalidis	One-Dimensional Finger Searching in RAM Model Revisited.	Panhellenic Conference on Informatics	2005	DBLP DOI BibTeX RDF
19	Heikki Hyyrö, Yoan J. Pinzón, Ayumi Shinohara	Fast Bit-Vector Algorithms for Approximate String Matching Under Indel Distance.	SOFSEM	2005	DBLP DOI BibTeX RDF
19	Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi	Tracking set-expression cardinalities over continuous update streams.	VLDB J.	2004	DBLP DOI BibTeX RDF	Set expressions, Data streams, Randomized algorithms, Approximate query processing, Data synopses
19	Jef Wijsen	Making More Out of an Inconsistent Database.	ADBIS	2004	DBLP DOI BibTeX RDF
19	Torsten Tholey	A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs.	ISAAC	2003	DBLP DOI BibTeX RDF
19	Eljas Soisalon-Soininen, Peter Widmayer	Single and Bulk Updates in Stratified Trees: An Amortized and Worst-Case Analysis.	Computer Science in Perspective	2003	DBLP DOI BibTeX RDF
19	Saar Cohen 0002, Yossi Matias	Spectral Bloom Filters.	SIGMOD Conference	2003	DBLP DOI BibTeX RDF
19	Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastogi	Processing Set Expressions over Continuous Update Streams.	SIGMOD Conference	2003	DBLP DOI BibTeX RDF
19	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier	Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation.	CIAC	2003	DBLP DOI BibTeX RDF	edge modification problems, data clustering, NP-complete problems, exact algorithms, fixed-parameter tractability
19	Haim Kaplan, Eyal Molad, Robert Endre Tarjan	Dynamic rectangular intersection with priorities.	STOC	2003	DBLP DOI BibTeX RDF	rectangular intersection, rectangular point location, packet classification, orthogonal range searching
19	Dana Shapira, James A. Storer	Large Edit Distance with Multiple Block Operations.	SPIRE	2003	DBLP DOI BibTeX RDF
19	Ashish Goel, Kamesh Munagala	Extending Greedy Multicast Routing to Delay Sensitive Applications.	Algorithmica	2002	DBLP DOI BibTeX RDF	Quality of service, Routing, Networks, Multicasting, Delay
19	S. Muthukrishnan 0001, Süleyman Cenk Sahinalp	Simple and Practical Sequence Nearest Neighbors with Block Operations.	CPM	2002	DBLP DOI BibTeX RDF
19	Menelaos I. Karavelas, Mariette Yvinec	Dynamic Additively Weighted Voronoi Diagrams in 2D.	ESA	2002	DBLP DOI BibTeX RDF
19	Eljas Soisalon-Soininen, Peter Widmayer	Amortized Complexity of Bulk Updates in AVL-Trees.	SWAT	2002	DBLP DOI BibTeX RDF
19	Gerth Stølting Brodal, Rolf Fagerberg	Dynamic Representation of Sparse Graphs.	WADS	1999	DBLP DOI BibTeX RDF
19	Amalia Duch, Vladimir Estivill-Castro, Conrado Martínez	Randomized K-Dimensional Binary Search Trees.	ISAAC	1998	DBLP DOI BibTeX RDF
19	Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger	Parametric and Kinetic Minimum Spanning Trees.	FOCS	1998	DBLP DOI BibTeX RDF
19	Dominique Laurent 0001, Viet Phan Luong, Nicolas Spyratos	The Use of Deleted Tuples in Database, Querying and Updating.	Acta Informatica	1997	DBLP DOI BibTeX RDF
19	Serafino Cicerone, Daniele Frigioni, Umberto Nanni, Francesco Pugliese	Counting Edges in a Dag.	WG	1996	DBLP DOI BibTeX RDF
19	Sotiris E. Nikoletseas, John H. Reif, Paul G. Spirakis, Moti Yung	Stochastic Graphs Have Short Memory: Fully Dynamic Connectivity in Poly-Log Expected Time.	ICALP	1995	DBLP DOI BibTeX RDF
19	Helmut Jürgensen, Stavros Konstantinidis	Variable-Length Codes for Error Correction.	ICALP	1995	DBLP DOI BibTeX RDF