Computational molecular biology : an algorithmic approach
By Pavel A. Pevzner. 2000
584 citations recorded by the source corpus.
Subfields: Molecular Biology
View Paper: https://www.semanticscholar.org/paper/087a1d737a4cc08cc9098f3b38b9d855858d98e4
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Molecular Biology
- Pavel A. Pevzner
- Glenn Tesler
- Daniel M. Martin
- Colton Magnant
- Michael I. Jordan
- Thomas G. Dietterich
- Elena V. Konstantinova
- Martin J. Wainwright
Citations in the corpus
- Some problems on Cayley graphs (2008, background): “For more details see the recently published books by Pevzner [58], Sankoff and El-Mabrouk [59].”
- Adaptive computation and machine learning (1998, background): “The conventional alignment schemes have been described in detail elsewhere [550, 428]; here we will focus on some of the important aspects related to the preparation of dedicated data sets.”
- An Eulerian path approach to DNA fragment assembly (2001, background): “The Chinese Postman Problem is closely related to the problem of finding a path visiting every edge of a graph exactlyonce,anEulerianPathProblem(24).”
- Graphical Models, Exponential Families, and Variational Inference (2008, background): “Problems of constraint satisfaction and combinatorial optimization arise in a wide variety of areas, among them artificial intelligence [63, 188], communication theory [84], computational complexity theory [52], statistical image processing [86], and bioinformatics [190].”
- An asymptotic version of a conjecture by Enomoto and Ota (2010, methodology): “modelled using colored graphs, i.e., graphs with colored edges and/or vertices [ 17 ].”
- Finding composite regulatory patterns in DNA sequences (2002, unknown): “They vary from a trivial one like the number of instances of the pattern in the sample to a more involved like distance from consensus, sum-of-pairs, entropy-based scores and others (see Pevzner (2000) ).”
- GRIMM: genome rearrangements web server (2002, methodology): “GRIMM implements the Hannenhalli‐Pevzner algorithms for computing unichromosomal and multichromosomal genomic distances (Hannenhalli and Pevzner, 1995, 1996, 1999; Pevzner, 2000 ).”
- Genome-scale evolution: reconstructing gene orders in the ancestral species. (2002, unknown): “However , the breakpoint analysis has some limitations in the analysis of pairwise genome rearrangements (Pevzner 2000).”