Entity usage

Showing below up to 50 results in range #1 to #50.

1. Large Scale Matching for Position Weight Matrices: Label: en
2. Efficient Algorithms for Regular Expression Constrained Sequence Alignment: Label: en
3. Algorithms for Finding a Most Similar Subforest: Label: en
4. Approximate Matching in Weighted Sequences: Label: en
5. Sublinear Algorithms for Parameterized Matching: Label: en
6. New Algorithms for Text Fingerprinting: Label: en
7. Faster Algorithms for Computing Longest Common Increasing Subsequences: Label: en
8. Reducing the Space Requirement of LZ-Index: Label: en
9. Dynamic Entropy-Compressed Sequences and Full-Text Indexes: Label: en
10. Statistical Encoding of Succinct Data Structures: Label: en
11. A Simpler Analysis of Burrows-Wheeler Based Compression: Label: en
12. Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs: Label: en
13. An $O(n^{3/2}\sqrt{\log (n)})$ Algorithm for Sorting by Reciprocal Translocations: Label: en
14. Local Alignment of RNA Sequences with Arbitrary Scoring Schemes: Label: en
15. A Compact Mathematical Programming Formulation for DNA Motif Finding: Label: en
16. Finding Common RNA Pseudoknot Structures in Polynomial Time: Label: en
17. Approximation of RNA Multiple Structural Alignment: Label: en
18. Faster Two Dimensional Scaled Matching: Label: en
19. Property Matching and Weighted Matching: Label: en
20. An Improved Algorithm for the Macro-evolutionary Phylogeny Problem: Label: en
21. Solving the Maximum Agreement SubTree and the Maximum Compatible Tree Problems on Many Bounded Degree Trees: Label: en
22. Subsequence Combinatorics and Applications to Microarray Production, DNA Sequencing and Chaining Algorithms: Label: en
23. On the Repeat-Annotated Phylogenetic Tree Reconstruction Problem: Label: en
24. Common Substrings in Random Strings: Label: en
25. Tiling an Interval of the Discrete Line: Label: en
26. Fingerprint Clustering with Bounded Number of Missing Values: Label: en
27. New Bounds for Motif Finding in Strong Instances: Label: en
28. Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures: Label: en
29. Obtaining Provably Good Performance from Suffix Trees in Secondary Storage: Label: en
30. On-Line Linear-Time Construction of Word Suffix Trees: Label: en
31. A Linear Size Index for Approximate Pattern Matching: Label: en
32. Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE: Label: en
33. Adaptive Searching in Succinctly Encoded Binary Relations and Tree-Structured Documents: Label: en
34. Identifying Co-referential Names Across Large Corpora: Label: en
35. Asynchronous Pattern Matching: Label: en
36. On the DCJ Median Problem: Label: en
37. Encodings for Range Majority Queries: Label: en
38. Most Recent Match Queries in On-Line Suffix Trees: Label: en
39. On Hardness of Several String Indexing Problems: Label: en
40. String Range Matching: Label: en
41. Approximate String Matching Using a Bidirectional Index: Label: en
42. Searching of Gapped Repeats and Subrepetitions in a Word: Label: en
43. Computing k-th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence: Label: en
44. Efficient Algorithms for Shortest Partial Seeds in Words: Label: en
45. A really Simple Approximation of Smallest Grammar: Label: en
46. Shortest Unique Substring Query Revisited: Label: en
47. Compactness-Preserving Mapping on Trees: Label: en
48. Computing Palindromic Factorizations and Palindromic Covers On-line: Label: en
49. Parameterized Complexity Analysis for the Closest String with Wildcards Problem: Label: en
50. Order-Preserving Pattern Matching with k Mismatches: Label: en