Bhaskar DasGupta, Lusheng Wang  Home/Search
Context
Related
| rutgers.edu/~bhaskar...lwang.chap4.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~bhaskar/resum...publ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Introduction The modern era of molecular biology began with the discovery of the double helical structure of DNA. Today, sequencing nucleic acids, the determination of genetic information at the most fundamental level, is a major tool of biological research [79]. This revolution in biology has created a huge amount of data at great speed by directly reading DNA sequences. The growth rate of data volume is exponential. For instance, the volume of DNA and protein sequence data is currently... (Update)
Similar documents (at the sentence level):
11.4%: Fixed Topology Alignment with Recombination - Ma, Wang, Li (Correct)
7.6%: On the Complexity and Approximation of Syntenic Distance - DasGupta, Jiang, Kannan, .. (1998) (Correct)
7.6%: Computing Distances between Evolutionary Trees - DasGupta, He, Jiang, Li.. (1998) (Correct)
Active bibliography (related documents): More All
1.6: On Computing the Nearest Neighbor Interchange Distance - DasGupta, He (1997) (Correct)
1.4: On Distances between Phylogenetic Trees - DasGupta, He, Jiang, Li, Tromp.. (1997) (Correct)
1.4: On Distances between Phylogenetic Trees (Extended.. - DasGupta, He, Jiang.. (Correct)
Similar documents based on text: More All
0.5: On the Structure of Syntenic Distance - Liben-Nowell (1999) (Correct)
0.4: Gossip is Synteny: Incomplete Gossip and an Exact Algorithm.. - Liben-Nowell (Correct)
0.4: Maximal Sub-Triangulation as Improving Phylogenetic Data - Berry, Sigayret, Sinoquet (2002) (Correct)
BibTeX entry: (Update)
@misc{ dasgupta-selected,
author = "Bhaskar DasGupta and Lusheng Wang",
title = "Selected Topics in Computational Biology",
url = "citeseer.ist.psu.edu/dasgupta98selected.html" }
Citations (may not include all citations):4212 Computers and Intractability: A Guide to the Theory of NP-co.. (context) - Garey, Johnson - 1979
951 Computational Complexity (context) - Papadimitriou - 1994 ACM
318 Approximation Algorithms for NP-hard Problems (context) - Hochbaum - 1996 ACM
147 and macromolecules: the theory and practice of sequence comp.. (context) - Sankoff, Kruskal et al. - 1983
146 The neighbor-joining method: a new method for reconstructing.. (context) - Saitou, Nei - 1987
112 and Sequences: Computer Science and Computational Biology (context) - Gusfield, Strings - 1997
81 Introduction to Computational Molecular Biology (context) - Meidanis, Setubal - 1997
80 Genome Rearrangements and Sorting by Reversals (context) - Bafna, Pevzner - 1993 ACM DBLP
65 the complexity of multiple sequence alignment (context) - Wang, Jiang - 1994
62 Molecular Biology of the gene (context) - Watson, Hopkins et al. - 1987
59 Construction of phylogenetic trees (context) - Fitch, Margoliash - 1967
58 Phylogenetic Inference (context) - Swofford, Olsen et al. - 1996
53 Sorting by Transpositions (context) - Bafna, Pevzner - 1995 ACM DBLP
52 Introduction to Computational Biology: Maps (context) - Waterman - 1995
49 A survey of multiple sequence comparison methods (context) - Chan, Wong et al. - 1992
48 polynomial algorithm for sorting signed permutations by reve.. (context) - Hannenhalli, Pevzner et al. - 1995
45 The multiple sequence alignment problem in biology (context) - Carrillo, Lipman - 1988 ACM
42 Efficient methods for multiple sequence alignment with guara.. (context) - Gusfield - 1993
40 The human genome project and informatics (context) - Frenkel - 1991 ACM DBLP
40 Toward defining the course of evolution: minimum change for .. (context) - Fitch - 1971
40 A simulation comparison of phylogeny algorithms under equal .. (context) - Kuhner, Felsenstein - 1994
38 Phylogenies from molecular sequences: inferences and reliabi.. (context) - Felsenstein - 1988
36 and hyperbolic geometry (context) - Sleator, Tarjan et al. - 1988
34 A tool for multiple sequence alignment (context) - Lipman, Altschul et al. - 1989
32 Speeding up dynamic programming with applications to molecul.. (context) - Galil, Ciancarlo - 1989 DBLP
31 An algorithm for approximate tandem repeats - Landau, Schmidt - 1993 ACM DBLP
31 Efficient Bounds for Oriented Chromosome Inversion Distance (context) - Kececioglu, Sankoff - 1994 ACM DBLP
30 the complexity of comparing evolutionary trees - Hein, Jiang et al. - 1996
26 Phylogenetic analysis: models and estimation procedures (context) - Cavalli-Sforza, Edwards - 1967
23 Sorting by Reversals: Genome Rearrangements in Plant Organel.. (context) - Bafna, Pevzner - 1995
22 Exact and Approximation Algorithms for the Inversion Distanc.. (context) - Kececioglu, Sankoff - 1993
22 A workbench for multiple alignment construction and analysis (context) - Schuler, Altschul et al.
21 Improved approximation algorithms for tree alignment (context) - Wang, Gusfield - 1997 ACM DBLP
21 Minimal mutation trees of sequences (context) - Sankoff - 1975
19 A heuristic method to reconstruct the history of sequences s.. (context) - Hein - 1993
18 Comparison of labeled trees with valency three (context) - Robinson - 1971
18 Approximation algorithms for tree alignment with a given phy.. (context) - Wang, Jiang et al. - 1996 DBLP
17 Line geometries for sequence comparisons (context) - Waterman, Perlwitz - 1984
17 Statistical analysis of hominoid molecular evolution (context) - Barry, Hartigan - 1987
17 and transition in the evolution of 5S ribosomal RNA (context) - Sankoff, Cedergren et al. - 1976
16 An algorithm for locating non-overlapping regions of maximum.. - Kannan, Myers - 1993 ACM DBLP
16 Short encodings of evolving structures (context) - Sleator, Tarjan et al. - 1992 ACM DBLP
16 A new method that simultaneously aligns and reconstructs anc.. (context) - Hein - 1989
16 Sequence alignments (context) - Waterman - 1989
15 and graph matching (context) - Pevzner, communication - 1992
15 Reconstructing evolution of sequences subject to recombinati.. (context) - Hein - 1990
14 Simultaneous comparisons of three or more sequences related .. (context) - Sankoff, Cedergren - 1983
14 Of Mice and Men: Evolutionary Distances Between Genomes unde.. (context) - Kececioglu, Ravi - 1995
14 the Complexity and Approximation of Syntenic Distance - DasGupta, Jiang et al. - 1997
14 approximation algorithm for the Steiner problem on networks (context) - Zelikovsky - 1993
14 Multiple sequence alignment (context) - Baconn, Anderson - 1986
14 Mapping and interpreting biological information (context) - Lander, Langridge et al. - 1991 ACM DBLP
14 An iterative approach from the standpoint of the additive hy.. (context) - Moore, Goodman et al. - 1973
13 A note on some tree similarity measures (context) - Wood - 1982
13 Original Synteny (context) - Ferretti, Nadeau et al. - 1996 ACM DBLP
12 Approximation algorithms for multiple sequence alignment und.. - Ravi, Kececioglu - 1995 ACM DBLP
12 Reconstructing a history of recombinations from a set of seq.. - Kececioglu, Gusfield - 1994 ACM DBLP
11 Journal of Theoretical Biology (context) - Waterman, Smith et al. - 1978
10 The reconstruction of evolution (context) - Edwards, Cavalli-Sforza - 1964
8 Comments on computing the similarity of binary trees (context) - Jarvis, Luedeman et al. - 1983
8 Properties of the nearest neighbor interchange metric for tr.. (context) - Day - 1983
8 Evolutionary trees for DNA sequences: a maximum likelihood a.. (context) - Felsenstein - 1981
8 Counterexamples in measuring the distance between binary tre.. (context) - Jarvis, Luedeman et al. - 1983
7 A tree reconstruction method that is economical in the numbe.. (context) - Hein - 1989
7 Phylogenetic Systematics as the Basis of Comparative Biology (context) - Funk, Brooks - 1990
7 Making the shortest-paths approach to sum-of-pairs multiple .. - Gupta, Kececioglu et al. - 1995
6 The deferred path heuristic for the generalized tree alignme.. - Schwikowski, Vingron - 1997 ACM DBLP
6 A more efficient approximation scheme for tree alignment (context) - Wang, Jiang et al. - 1997 ACM DBLP
6 Computing the nearest neighbor interchange metric for unlabe.. (context) - Kriv'anek - 1986
5 the linear-cost subtree-transfer distance (context) - DasGupta, He et al. - 1998
5 th Annual ACM-SIAM Symposium on Discrete Algorithms (context) - DasGupta, He et al. - 1997
5 and multiple sequence alignment (context) - Altschul, Lipman et al. - 1989
4 Fixed topology alignment with recombination - Ma, Wang et al. ACM DBLP
3 Genetic recombination (context) - Stahl - 1987
3 Approximate methods for multiple sequence alignment (context) - Bafna, Lawer et al. - 1994
3 the nearest neighbor interchange distance between evolutiona.. (context) - Li, Tromp et al. - 1996
2 The tree alignment problem is NPcomplete (context) - Sweedyk, Warnow
1 Artificial Intelligence in Molecular Biology (context) - Hunter - 1993
1 String Searching Algorithms (context) - Stephens - 1994 ACM DBLP
1 A simplified proof of the NP-hardness and MAX SNPhardness of.. (context) - Wareham - 1995
1 rd IEEE Symposium on Foundations of Computer Science (context) - Arora, Lund et al. - 1992
1 Integrative Approaches to Molecular Biology (context) - Collado-Vides, Magasanik et al. - 1996
1 A point of contact between computer science and molecular bi.. (context) - Miller, Scbwartz et al. - 1994 ACM
1 Applications of Molecular Systematics (context) - Hillis, Mable et al. - 1996
Documents on the same site (http://crab.rutgers.edu/~bhaskar/resume/publ/publ.html): More
On a Learnability Question Associated to Neural.. - DasGupta, Siegelmann, .. (1994) (Correct)
Provably Good Algorithms for Transmission Scheduling in WDM.. - Palis, Dasgupta (Correct)
Scheduling Transmissions in WDM Optical Networks - DasGupta, Palis (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC