Lior Pachter

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Marina Alexandersson

> Home > Persons > Lior Pachter

Publications

2003
[j12]
- view
  authority control:
- export record
  dblp key:
  - journals/jcb/LamAP03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/LamAP03
Fumei Lam, Marina Alexandersson, Lior Pachter:
Picking Alignments from (Steiner) Trees. J. Comput. Biol. 10(3/4): 509-520 (2003)
[j11]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/nar/CawleyPA03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/nar/CawleyPA03
Simon Cawley, Lior Pachter, Marina Alexandersson:
SLAM web server for comparative gene finding and alignment. Nucleic Acids Res. 31(13): 3507-3509 (2003)
2002
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/jcb/PachterAC02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcb/PachterAC02
Lior Pachter, Marina Alexandersson, Simon Cawley:
Applications of Generalized Pair Hidden Markov Models to Alignment and Gene Finding Problems. J. Comput. Biol. 9(2): 389-399 (2002)
2001
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/recomb/PachterAC01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/recomb/PachterAC01
Lior Pachter, Marina Alexandersson, Simon Cawley:
Applications of generalized pair hidden Markov models to alignment and gene finding problems. RECOMB 2001: 241-248

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.