diff --git a/man/MatchingSplitDistance.Rd b/man/MatchingSplitDistance.Rd
index 068bde47..84d2a180 100644
--- a/man/MatchingSplitDistance.Rd
+++ b/man/MatchingSplitDistance.Rd
@@ -52,7 +52,7 @@ or \code{splits1} and \code{splits2}.
 \description{
 Calculate the
 \href{https://ms609.github.io/TreeDist/articles/Generalized-RF.html#matching-split-distance}{Matching Split Distance}
-\insertCite{Bogdanowicz2012,Lin2012}{TreeDist} for unrooted binary trees.
+\insertCite{Bogdanowicz2012,Lin2012}{BigTreeDist} for unrooted binary trees.
 }
 \details{
 Trees need not contain identical leaves; scores are based on the leaves that
diff --git a/man/TreeDistance.Rd b/man/TreeDistance.Rd
index fffb9f4d..511d38b9 100644
--- a/man/TreeDistance.Rd
+++ b/man/TreeDistance.Rd
@@ -150,7 +150,7 @@ between trees (including leaving a split unpaired).
 
 The methods implemented here use the concepts of
 \href{https://ms609.github.io/TreeDist/articles/information.html}{entropy and information}
-\insertCite{Mackay2003}{TreeDist} to assign a similarity score between each
+\insertCite{Mackay2003}{BigTreeDist} to assign a similarity score between each
 pair of splits.
 
 The returned tree similarity measures state the amount of information,