Nicolae et al., 2014 - Google Patents
Efficient sequential and parallel algorithms for planted motif searchNicolae et al., 2014
View HTML- Document ID
- 10535772536278985838
- Author
- Nicolae M
- Rajasekaran S
- Publication year
- Publication venue
- BMC bioinformatics
External Links
Snippet
Background Motif searching is an important step in the detection of rare events occurring in a set of DNA or protein sequences. One formulation of the problem is known as (l, d)-motif search or Planted Motif Search (PMS). In PMS we are given two integers l and d and n …
- 102100003903 PMS2P1 0 abstract description 55
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30386—Retrieval requests
- G06F17/30424—Query processing
- G06F17/30533—Other types of queries
- G06F17/30545—Distributed queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30312—Storage and indexing structures; Management thereof
- G06F17/30321—Indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30587—Details of specialised database models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30286—Information retrieval; Database structures therefor; File system structures therefor in structured data stores
- G06F17/30289—Database design, administration or maintenance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for programme control, e.g. control unit
- G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30067—File systems; File servers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30017—Multimedia data retrieval; Retrieval of more than one type of audiovisual media
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F19/00—Digital computing or data processing equipment or methods, specially adapted for specific applications
- G06F19/10—Bioinformatics, i.e. methods or systems for genetic or protein-related data processing in computational molecular biology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F15/00—Digital computers in general; Data processing equipment in general
- G06F15/16—Combinations of two or more digital computers each having at least an arithmetic unit, a programme unit and a register, e.g. for a simultaneous processing of several programmes
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Nicolae et al. | Efficient sequential and parallel algorithms for planted motif search | |
| Plantenga | Inexact subgraph isomorphism in mapreduce | |
| Mullesgaard et al. | Efficient skyline computation in MapReduce | |
| Muggli et al. | Building large updatable colored de Bruijn graphs via merging | |
| Crainiceanu et al. | Bloofi: Multidimensional bloom filters | |
| Mohamed et al. | MRO-MPI: MapReduce overlapping using MPI and an optimized data exchange policy | |
| Kolb et al. | Learning-based entity resolution with MapReduce | |
| Matthews et al. | MrsRF: an efficient MapReduce algorithm for analyzing large collections of evolutionary trees | |
| Zhang et al. | Enhancement of accuracy and efficiency for RNA secondary structure prediction by sequence segmentation and MapReduce | |
| Abdalla | An efficient approach for data placement in distributed systems | |
| Kumari et al. | Scalable parallel algorithms for shared nearest neighbor clustering | |
| US9747363B1 (en) | Efficient storage and retrieval of sparse arrays of identifier-value pairs | |
| Rahman et al. | Compression algorithm for colored de Bruijn graphs | |
| Mitchell et al. | Parallel classification and feature selection in microarray data using SPRINT | |
| Huang et al. | Faster parallel exact density peaks clustering | |
| Rathee et al. | StreamAligner: a streaming based sequence aligner on Apache Spark | |
| Liu et al. | Par-BF: A parallel partitioned Bloom filter for dynamic data sets | |
| Perwej et al. | An extensive investigate the mapreduce technology | |
| Doulkeridis et al. | Parallel and distributed processing of spatial preference queries using keywords | |
| Goyal et al. | Parallelizing optics for commodity clusters | |
| Schatz et al. | Parallel network motif finding | |
| Srikakulam et al. | MetaProFi: A protein-based Bloom filter for storing and querying sequence data for accurate identification of functionally relevant genetic variants | |
| Li et al. | SeqMapReduce: software and web service for accelerating sequence mapping | |
| NR et al. | MapReduce‐based storage and indexing for big health data | |
| Kalidhindi et al. | Angela: A sparse, distributed, and highly concurrent merkle tree |